Commit b8f6033

committed

upd: 删除链表倒数元素

1 parent e28e155 commit b8f6033Copy full SHA for b8f6033

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,3 +16,4 @@ LeetCode JavaScript Solution`
`16`	`16`	`\| Reverse Integer \| Easy \| 2018年01月19日 \|`
`17`	`17`	`\| Regular Expression Matching \| Hard \| 2018年03月09日 \|`
`18`	`18`	`\| Palindrome Number \| Easy \| 2018年03月16日 \|`
	`19`	`+\| Remove Nth Node From End of List \| Medium \| 2018年03月16日 \|`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+/**`
	`2`	`+ * Definition for singly-linked list.`
	`3`	`+ * function ListNode(val) {`
	`4`	`+ * this.val = val;`
	`5`	`+ * this.next = null;`
	`6`	`+ * }`
	`7`	`+ */`
	`8`	`+/**`
	`9`	`+ * @param {ListNode} head`
	`10`	`+ * @param {number} n`
	`11`	`+ * @return {ListNode}`
	`12`	`+ */`
	`13`	`+var removeNthFromEnd = function(head, n) {`
	`14`	`+ let count = 0;`
	`15`	`+ let p = head;`
	`16`	`+ while (p) {`
	`17`	`+ ++count;`
	`18`	`+ p = p.next;`
	`19`	`+ }`
	`20`	`+ let index = count - n;`
	`21`	`+ p = head;`
	`22`	`+ let prev = null;`
	`23`	`+ while (index) {`
	`24`	`+ prev = p;`
	`25`	`+ p = p.next;`
	`26`	`+ --index;`
	`27`	`+ }`
	`28`	`+ if (prev) {`
	`29`	`+ prev.next = p.next;`
	`30`	`+ } else {`
	`31`	`+ head = head.next;`
	`32`	`+ }`
	`33`	`+ return head;`
	`34`	`+};`

Comments

(0)