链表
Candy_Rainbow_
这个作者很懒,什么都没留下…
展开
-
JS力扣刷题 92. 反转链表 II
var reverseBetween = function(head, left, right) { let pre = new ListNode(0, head); head = pre; //找到left的前一个 for (let i = 0; i < left - 1; ++i) { pre = pre.next; } let p = pre.next; //在p之前不断的头插法 for(let i = 0; i .原创 2022-04-17 15:18:33 · 576 阅读 · 0 评论 -
JS力扣刷题86. 分隔链表
var partition = function(head, x) { let f = r = new ListNode(); let p = q = head; //第一次遍历,将小的放进来 while(p){ if(p.val < x){ let insert = new ListNode(p.val); r.next = insert; r = insert; .原创 2022-04-16 18:15:20 · 423 阅读 · 0 评论 -
JS力扣刷题 83. 删除排序链表中的重复元素
var deleteDuplicates = function(head) { let pre = new ListNode(Infinity, null); pre.next = head; let p = head; head = pre; while(p){ if(pre.val == p.val){ p = p.next; pre.next = p; }else{ .原创 2022-04-16 18:14:29 · 126 阅读 · 0 评论 -
JS力扣刷题 82.删除排序链表中的重复元素 II
var deleteDuplicates = function(head) { let pre = new ListNode(); pre.next = head; let p = head; head = pre; //p不空的话 while(p){ //找到相同值的最后一个结点 while(p.next && p.val == p.next.val)p = p.next; if(pre.ne.原创 2022-04-15 14:11:24 · 450 阅读 · 0 评论 -
JS力扣刷题61. 旋转链表
var rotateRight = function(head, k) { //计算链表的长度 let h = head; let len = 0; while(h){ len++; h = h.next; } //长度为0和1时直接返回 if(len == 0 || len == 1)return head; //对k取余 k = k % len; //向后移动一位返回新head fu.原创 2022-04-11 15:26:02 · 427 阅读 · 0 评论