Name		Name	Last commit message	Last commit date
Latest commit History 126 Commits
1-2-3-...-n		1-2-3-...-n
1.search in 2d array		1.search in 2d array
11.Number of 1		11.Number of 1
14.The last Kth node		14.The last Kth node
18.print Matrix		18.print Matrix
2.replace sapce		2.replace sapce
20.pop and push stack		20.pop and push stack
22.VerifySquenceOfBST		22.VerifySquenceOfBST
23.Find Path in Binary Tree		23.Find Path in Binary Tree
24.Copy Complex List.		24.Copy Complex List.
25.SBT to Durl List		25.SBT to Durl List
26.String sort and print		26.String sort and print
27.MoreThanHalfNum		27.MoreThanHalfNum
28.NumberOf1Between1AndN		28.NumberOf1Between1AndN
29.FindGreatestSumOfSubArray		29.FindGreatestSumOfSubArray
3.print list from tail to head		3.print list from tail to head
30.Get Least K Numbers		30.Get Least K Numbers
31.Construct the least number		31.Construct the least number
32.Ugly number		32.Ugly number
4.reConstructBinaryTree		4.reConstructBinaryTree
47.ADD two sum no		47.ADD two sum no
5.two tacks implemention a quene		5.two tacks implemention a quene
6.find the minimize number in a rotate array		6.find the minimize number in a rotate array
8.jump floor		8.jump floor
Backtracking		Backtracking
JD_909		JD_909
Max Heap and Min heap		Max Heap and Min heap
Merge two stored lists		Merge two stored lists
PrimeCount		PrimeCount
Split List		Split List
Tree		Tree
data structure		data structure
dp		dp
haoweilai_100tal		haoweilai_100tal
neteasa		neteasa
sort		sort
string to num		string to num
test_360		test_360
toutiao		toutiao
README.md		README.md

Repository files navigation

Nowcode

刷题！刷题！刷题！！！
找工作！！！

No description, website, or topics provided.

No releases published