We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cc90062 commit 6ea2309Copy full SHA for 6ea2309
lesson_12/structs_ts/src/lesson12.ts
@@ -6,6 +6,27 @@ export class Lesson12 {
6
* https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
7
*/
8
public gameResult(head: ListNode | null): string {
9
- return '';
+ let oddPoints: number = 0;
10
+ let evenPoints: number = 0;
11
+
12
+ let curr = head;
13
14
+ while (curr != null && curr.next != null) {
15
+ if (curr.val > curr.next.val) {
16
+ evenPoints++;
17
+ } else if (curr.val < curr.next.val) {
18
+ oddPoints++;
19
+ }
20
+ curr = curr.next.next as ListNode;
21
22
23
+ if (oddPoints > evenPoints) {
24
+ return "Odd";
25
+ } else if (oddPoints < evenPoints) {
26
+ return "Even";
27
+ } else {
28
+ return "Tie";
29
30
}
31
32
0 commit comments