上一页 1 ··· 3 4 5 6 7 8 9 10 下一页
摘要: Description: Given a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if ther 阅读全文
posted @ 2020-11-26 22:40 summer_mimi 阅读(53) 评论(0) 推荐(0) 编辑
摘要: Description: A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Retur 阅读全文
posted @ 2020-11-26 21:03 summer_mimi 阅读(70) 评论(0) 推荐(0) 编辑
摘要: Description: Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some 阅读全文
posted @ 2020-11-21 23:06 summer_mimi 阅读(85) 评论(0) 推荐(0) 编辑
摘要: Description: Reverse a linked list from position m to n. Do it in one-pass. Note: 1 ≤ m ≤ n ≤ length of list. Link: https://leetcode.com/problems/reve 阅读全文
posted @ 2020-11-20 17:59 summer_mimi 阅读(103) 评论(0) 推荐(0) 编辑
摘要: Description: Reverse a singly linked list. Link: https://leetcode.com/problems/reverse-linked-list/ Examples: Example: Input: 1->2->3->4->5->NULL Outp 阅读全文
posted @ 2020-11-19 09:48 summer_mimi 阅读(103) 评论(0) 推荐(0) 编辑
摘要: Description: Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should 阅读全文
posted @ 2020-11-18 22:53 summer_mimi 阅读(75) 评论(0) 推荐(0) 编辑
摘要: Description: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return th 阅读全文
posted @ 2020-11-17 12:37 summer_mimi 阅读(70) 评论(0) 推荐(0) 编辑
摘要: Description: Given a sorted linked list, delete all duplicates such that each element appear only once. Link: https://leetcode.com/problems/remove-dup 阅读全文
posted @ 2020-11-17 09:21 summer_mimi 阅读(75) 评论(0) 推荐(0) 编辑
摘要: Decription: Given the head of a linked list, rotate the list to the right by k places. Link: https://leetcode.com/problems/rotate-list/ 思路: 假设链表的长度是 l 阅读全文
posted @ 2020-11-16 19:21 summer_mimi 阅读(72) 评论(0) 推荐(0) 编辑
摘要: Description: Given a linked list, swap every two adjacent nodes and return its head. You may not modify the values in the list's nodes. Only nodes its 阅读全文
posted @ 2020-11-15 20:34 summer_mimi 阅读(49) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 10 下一页