142. Linked List Cycle II
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
- 11月 09 週三 202218:42
[LeetCode] 142. Linked List Cycle II
142. Linked List Cycle II
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
- 11月 09 週三 202215:53
[LeetCode] 141. Linked List Cycle
141. Linked List Cycle
Given head, the head of a linked list, determine if the linked list has a cycle in it.
- 11月 08 週二 202216:20
[LeetCode] 160. Intersection of Two Linked Lists
160. Intersection of Two Linked Lists
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 intersection at all, return null.
- 11月 07 週一 202200:05
[LeetCode] 876. Middle of the Linked List
876. Middle of the Linked List
Given the head of a singly linked list, return the middle node of the linked list.
- 11月 06 週日 202215:01
[LeetCode] 206. Reverse Linked List
206. Reverse Linked List
Given the head of a singly linked list, reverse the list, and return the reversed list.
- 11月 04 週五 202216:42
[LeetCode] 21. Merge Two Sorted Lists
21. Merge Two Sorted Lists
You are given the heads of two sorted linked lists list1 and list2.
- 10月 28 週五 202220:54
[LeetCode] 33. Search in Rotated Sorted Array
There is an integer array nums sorted in ascending order (with distinct values).
- 10月 26 週三 202212:36
[LeetCode] 540. Single Element in a Sorted Array
You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.
Return the single element that appears only once.
- 10月 24 週一 202211:06
[LeetCode] 34. Find First and Last Position of Element in Sorted Array
Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
- 10月 21 週五 202221:48
[LeetCode] 278. First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.
烘焙 (2)