We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明: 1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4 输出: 1->4->3->2->5->NULL
The text was updated successfully, but these errors were encountered:
92.反转链表 II #162
89d75f7
Merge pull request #163 from zzcyes/develop
eeba847
f7a6ac4
/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } */ /** * @param {ListNode} head * @param {number} m * @param {number} n * @return {ListNode} */ var reverseBetween = function(head, m, n) { let count = n - m; let p = (dummyHead = new ListNode()); let pre, cur, front, tail; p.next = head; for (let i = 0; i < m - 1; i++) { p = p.next; } front = p; pre = tail = p.next; cur = pre.next; for (let i = 0; i < count; i++) { let next = cur.next; cur.next = pre; pre = cur; cur = next; } front.next = pre; tail.next = cur; return dummyHead.next; };
Sorry, something went wrong.
Merge pull request #164 from zzcyes/develop
aef0536
zzcyeah
zzcyes
No branches or pull requests
题目
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
The text was updated successfully, but these errors were encountered: