Commit 870700a

committed

day-16:

1 parent 9bf9528 commit 870700aCopy full SHA for 870700a

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,3 +16,4 @@`
`16`	`16`	`- Day 13: [Remove K Digits](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-thirteen/index.ts) :tongue:`
`17`	`17`	`- Day 14: [Implement Trie (Prefix Tree)](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-thirteen/index.ts) :pig_nose:`
`18`	`18`	`- Day 15: [Maximum Sum Circular Subarray](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-fifteen/index.ts) :whale:`
	`19`	`+ - Day 16: [Odd Even Linked List](https://github.com/libterty/leetcode-challenge/blob/master/src/may/day-sixteen/index.ts) :whale:`

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+class ListNode {`
	`2`	`+ public data: number;`
	`3`	`+ public next: ListNode;`
	`4`	`+ constructor(data, next = null) {`
	`5`	`+ this.data = data;`
	`6`	`+ this.next = next;`
	`7`	`+ }`
	`8`	`+}`
	`9`	`+`
	`10`	`+var oddEvenList = function (head: ListNode) {`
	`11`	`+ const odd: ListNode = new ListNode(0);`
	`12`	`+ const even: ListNode = new ListNode(1);`
	`13`	`+ let _odd: ListNode = odd;`
	`14`	`+ let _even: ListNode = even;`
	`15`	`+ let flag: boolean = true;`
	`16`	`+ while (head) {`
	`17`	`+ if (flag) {`
	`18`	`+ _odd.next = head;`
	`19`	`+ _odd = _odd.next;`
	`20`	`+ } else {`
	`21`	`+ _even.next = head;`
	`22`	`+ _even = _even.next;`
	`23`	`+ }`
	`24`	`+ flag != flag;`
	`25`	`+ head = head.next;`
	`26`	`+ }`
	`27`	`+`
	`28`	`+ _odd.next = even.next;`
	`29`	`+ _even.next = null;`
	`30`	`+`
	`31`	`+ return odd.next;`
	`32`	`+};`

Comments

(0)