链表
菜鸡快飞
这个作者很懒,什么都没留下…
展开
-
删除排序链表
83.删除排序链表class Solution { public ListNode deleteDuplicates(ListNode head) { ListNode curr = head; while(curr!=null&&curr.next!=null){ if(curr.val == curr.next.val){ curr.next = curr.next.next;原创 2022-05-24 22:15:03 · 48 阅读 · 0 评论 -
环形链表.
141.环形链表public class Solution { public boolean hasCycle(ListNode head) { if(head == null) return false; ListNode slow = head; ListNode fast = head; while(fast!=null&&fast.next!=null){ fast = fast.nex原创 2022-05-13 21:21:40 · 40 阅读 · 0 评论 -
合并有序链表
21.合并两个有序链表class Solution { public ListNode mergeTwoLists(ListNode list1, ListNode list2) { ListNode dummy = new ListNode(0); ListNode pre = dummy; while(list1!=null&&list2!=null){ if(list1.val < list2.va原创 2022-05-13 19:33:37 · 161 阅读 · 0 评论 -
反转链表加强
25.K个一组反转链表public ListNode reverseKGroup(ListNode head, int k) { ListNode dummy = new ListNode(0, head); ListNode pre = dummy; ListNode end = dummy; while(end.next != null){ for(int i = 0; i < k && en原创 2022-05-12 21:16:59 · 60 阅读 · 0 评论 -
反转链表Ⅰ、Ⅱ(递归&迭代)
206.反转链表// 迭代public ListNode reverseList(ListNode head){ ListNode pre = null; ListNode next; while(head!=null){ next = head.next; head.next = pre; pre = head; head = next; } return pre;}// 递归public ListNode reverseList(ListNode head){ i原创 2022-05-12 14:13:33 · 75 阅读 · 0 评论 -
删除链表元素
203移除链表元素class Solution { public ListNode removeElements(ListNode head, int val) { ListNode dummy = new ListNode(0, head); ListNode curr = head; ListNode pre = dummy; ListNode next; while(curr != null){原创 2022-05-10 22:38:29 · 240 阅读 · 0 评论