Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Feat: Makes changes to Lesson_12.java/ts and Stack.java/ts for homework and extra credit Lesson_12 - Joseph Caballero #430

Closed
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -2,11 +2,28 @@

public class Lesson12 {

public Lesson12() {}

/**
* Provide the solution to LeetCode 3062 here:
* https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
*/
public String gameResult(ListNode head) {
return null;
ListNode current = head;
int oddPoints = 0;
int evenPoints = 0;
while (current != null) {
if (current.val > current.next.val) {
evenPoints++;
} else {
oddPoints++;
}
current = current.next.next;
}
if (evenPoints > oddPoints) {
return "Even";
} else if (evenPoints < oddPoints) {
return "Odd";
} else return "Tie";
}
}
Original file line number Diff line number Diff line change
Expand Up @@ -9,18 +9,22 @@ public Stack() {
}

public void push(int value) {
// Your code here
ListNode pushedVal = new ListNode(value);
pushedVal.next = top;
top = pushedVal;
}

public int pop() {
return 0;
int val = top.val;
top = top.next;
return val;
}

public int peek() {
return 0;
return top.val;
}

public boolean isEmpty() {
return true;
return top == null;
}
}
32 changes: 31 additions & 1 deletion lesson_12/structs_ts/src/lesson12.ts
Original file line number Diff line number Diff line change
Expand Up @@ -6,6 +6,36 @@ export class Lesson12 {
* https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
*/
public gameResult(head: ListNode | null): string {
return '';
let current = head;
let oddPoints = 0;
let evenPoints = 0;

while (current != null && current.next != null) {
if (current.next.next == null) {
if (current.val > current.next.val) {
evenPoints++;
break;
} else {
oddPoints++;
break;
}
} else {
if (current.val > current.next.val) {
evenPoints++;
current = current.next.next;
} else {
oddPoints++;
current = current.next.next;
}
}
}

if (oddPoints > evenPoints) {
return 'Odd';
} else if (oddPoints < evenPoints) {
return 'Even';
} else {
return 'Tie';
}
}
}
16 changes: 12 additions & 4 deletions lesson_12/structs_ts/src/stack.ts
Original file line number Diff line number Diff line change
Expand Up @@ -8,18 +8,26 @@ export class Stack {
}

push(value: number): void {
throw new Error('Not implemented');
const pusher = new ListNode(value);
pusher.next = this.top;
this.top = pusher;
}

pop(): number | undefined {
throw new Error('Not implemented');
const val = this.top?.val;
this.top = this.top?.next;
return val;
}

peek(): number | null {
throw new Error('Not implemented');
if (this.top != null) {
return this.top.val;
} else {
throw new Error('empty stack');
}
}

isEmpty(): boolean {
throw new Error('Not implemented');
return this.top == null;
}
}