搜索资源列表
3Sum
- 比较好的leetcode编程的代码答案，使用的是C++写的，可以具体见网站查看-The answer better leetcode programming code, using c++ written, you can see the web site to see
test2.1.1_2.1.2
- leetcode 代码 Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in place such that each element appear only onceand return the new length.Do not allocate extra space for another array, you must do this in place with co
test2.1.3
- leetcode代码 Search in Rotated Sorted Array Suppose a sorted array 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 given a target value to search. If found in the array return its index, o
2.1.5_sourse
- leetcode 原创代码 Median of Two Sorted Arrays There are two sorted arrays A and B of size m and n respectively. Find the median of the two sortedarrays. The overall run time complexity should be O(log(m + n)).(2.1.5 Median of Two Sorted Arrays There
2.1.6
- leetcode 原创代码 Longest Consecutive Sequence Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is [1,2, 3, 4]. Retu
2.1.7
- Two Sum Given an array of integers, find two numbers such that they add up to a specific target number.The function two Sum should return indices of the two numbers such that they add up to the target, whereindex1 must be less than index2. Please
github
- leetcode 上面的数据结构与算法相关的题目代码，主要用C编写。现在只有一小部分，以后还会有更多的习题和对应的代码(Leetcode above the data structure and algorithm related topic code, mainly written in C. There's only a small part of it now, and there will be more exercises and corresponding code in the f
ContainerWithMostWater
- 用O（n）的时间得到了答案。采用了哨兵的方式。(The answer is obtained with the time of O (n). The sentinel was used.)
CleanCodeHandbook_v1.0.1.pdf
- leetcode编程指导clean code handbook(leetcode clean code handbook)