LeetCode
文章平均质量分 61
huhuixinxing
这个作者很懒,什么都没留下…
展开
-
LeetCode 21.Merge Two Sorted Lists
LeetCode 21.Merge Two Sorted Lists原创 2017-11-14 14:45:14 · 153 阅读 · 0 评论 -
LeetCode 2.Add Two Numbers
Add two Nums原创 2017-11-14 14:43:02 · 194 阅读 · 0 评论 -
LeetCode 141. Linked List Cycle && 142. Linked List Cycle II
LeetCode 141. Linked List Cycle && 142. Linked List Cycle II原创 2017-11-14 14:40:29 · 333 阅读 · 0 评论 -
LeetCode 11. Container With Most Water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin原创 2017-12-02 17:22:53 · 132 阅读 · 0 评论 -
LeetCode 26. Remove Duplicates from Sorted Array && 80. Remove Duplicates from Sorted Array II
LeetCode 26. Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for an原创 2017-12-02 17:32:30 · 149 阅读 · 0 评论 -
LeetCode 27. Remove Element
Given an array and a value, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-plac原创 2017-12-02 17:33:28 · 140 阅读 · 0 评论 -
LeetCode 31. Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible orde原创 2017-12-02 17:34:07 · 175 阅读 · 0 评论 -
LeetCode 33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
###LeetCode 33. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are gi原创 2017-12-02 17:36:04 · 235 阅读 · 0 评论 -
LeetCode 34. Search for a Range
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target is原创 2017-12-02 17:36:51 · 186 阅读 · 0 评论 -
LeetCode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.在一个有序数组中寻找目标值,如果找到就返回下标,找不到就返回它在有序数组中应该插入的位置。原创 2017-12-02 17:37:45 · 198 阅读 · 0 评论 -
LeetCode 19.Remove Nth Node From End of List
LeetCode 19.Remove Nth Node From End of List原创 2017-11-14 14:43:51 · 277 阅读 · 0 评论 -
LeetCode 61. Rotate List
LeetCode 61. Rotate List原创 2017-11-14 14:46:28 · 145 阅读 · 0 评论 -
LeetCode 86. Partition List
LeetCode 86. Partition List原创 2017-11-14 14:47:53 · 176 阅读 · 0 评论 -
LeetCode 24.Swap Nodes in Pairs
LeetCode 24.Swap Nodes in Pairs原创 2017-11-14 14:45:44 · 160 阅读 · 0 评论 -
LeetCode 83. Remove Duplicates from Sorted List
LeetCode 83. Remove Duplicates from Sorted List原创 2017-11-14 14:47:02 · 164 阅读 · 0 评论 -
LeetCode 82. Remove Duplicates from Sorted List II
LeetCode 82. Remove Duplicates from Sorted List II原创 2017-11-14 14:47:32 · 153 阅读 · 0 评论 -
LeetCode 206. Reverse Linked List && 92. Reverse Linked List II
LeetCode 206. Reverse Linked List && 92. Reverse Linked List II原创 2017-11-14 14:48:25 · 204 阅读 · 0 评论 -
LeetCode其他链表简单题
其他链表简单题160. Intersection of Two Linked ListsWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2原创 2017-11-15 11:04:27 · 168 阅读 · 0 评论 -
LeetCode 143. Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes’ values.For example, Given {1,2,3,4}, reorder it to {1,4,2,3}原创 2017-11-15 13:41:47 · 141 阅读 · 0 评论 -
LeetCode 328. Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in plac原创 2017-11-15 15:08:25 · 150 阅读 · 0 评论 -
LeetCode 1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same ele原创 2017-12-02 17:21:36 · 136 阅读 · 0 评论 -
LeetCode 138. Copy List with Random Pointer
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.Return a deep copy of the list.本题出现了一个新的链表结点结构,结点有两个指针域,一个指向下一个结点,一个指向原创 2017-11-15 11:02:50 · 157 阅读 · 0 评论 -
LeetCode 39. Combination Sum && 40. Combination Sum II && 216. Combination Sum III
39. Combination SumGiven a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number ma原创 2017-12-02 21:10:39 · 234 阅读 · 1 评论