摘要：
You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be on the following form 阅读全文
posted @ 2019-11-10 14:46
CNoodle
阅读(443)
评论(0)
推荐(0)
摘要：
Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Example 1: Input: head = [1,2,2,1] Output: true Example 阅读全文
posted @ 2019-11-10 09:28
CNoodle
阅读(212)
评论(0)
推荐(0)
摘要：
You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing toge 阅读全文
posted @ 2019-11-10 08:01
CNoodle
阅读(642)
评论(0)
推荐(0)
摘要：
Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersec 阅读全文
posted @ 2019-11-10 07:54
CNoodle
阅读(217)
评论(0)
推荐(0)
摘要：
Given the head of a linked list, return the list after sorting it in ascending order. Follow up: Can you sort the linked list in O(n logn) time and O( 阅读全文
posted @ 2019-11-10 05:54
CNoodle
阅读(565)
评论(0)
推荐(0)
摘要：
Given the head of 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 there 阅读全文
posted @ 2019-11-10 05:24
CNoodle
阅读(476)
评论(0)
推荐(0)
摘要：
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 node in the 阅读全文
posted @ 2019-11-10 04:16
CNoodle
阅读(429)
评论(0)
推荐(0)
浙公网安备 33010602011771号