GitHub - edgellheather795/pyleetcode: leetcode solutions from python

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
.gitignore		.gitignore
996.py		996.py
DFS.py		DFS.py
boomerangs.py		boomerangs.py
findLongestChain.py		findLongestChain.py
findMaxForm.py		findMaxForm.py
findNumber.py		findNumber.py
huawei.py		huawei.py
huaweiMax.py		huaweiMax.py
huaweiString.py		huaweiString.py
image.py		image.py
increasingTriplet.py		increasingTriplet.py
isPalindrome.py		isPalindrome.py
kthSmallestBST.py		kthSmallestBST.py
lengthOfLIS.py		lengthOfLIS.py
longestMoutain.py		longestMoutain.py
maxKFrequent.py		maxKFrequent.py
maxProfit.py		maxProfit.py
mergeSort.py		mergeSort.py
minChangeWord.py		minChangeWord.py
minHeap.py		minHeap.py
minPath.py		minPath.py
minPathSum.py		minPathSum.py
mostApple.py		mostApple.py
nearestPalindromic.py		nearestPalindromic.py
partitionLabels.py		partitionLabels.py
preOrder.py		preOrder.py
readme.txt		readme.txt
rob.py		rob.py
setZeros.py		setZeros.py
smallerNumbersThanCurrent.py		smallerNumbersThanCurrent.py
sumRootToLeaf.py		sumRootToLeaf.py
swapXY.py		swapXY.py

Repository files navigation

dynamic programming learning and exercise
https://zhuanlan.zhihu.com/p/91582909
1. Find out the what the element of array means
2. Relationships of the adjacency elements, how to calculate [i][j], [i-1][j-1], [i-1][j] and [i][j-1]
3. Find out initialization elements
4. Optimal
https://leetcode-cn.com/tag/dynamic-programming/