Commit fe62196

authored

Update README.md

1 parent 06c7d0f commit fe62196Copy full SHA for fe62196

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -630,6 +630,15 @@ class Solution:`
`630`	`630`	`- dp递归方程:到达当前楼梯的路径数 = 到达上个楼梯的路径数 + 到达上上个楼梯的路径数`
`631`	`631`	`- 这里用一个元组 r 来储存(当前楼梯路径数,下一层楼梯路径数)`
`632`	`632`	`- 利用 reduce 来代替for循环。[reduce 函数详解](https://www.cnblogs.com/XXCXY/p/5180245.html)`
	`633`	`+## [71. Simplify Path 4行](https://leetcode.com/problems/simplify-path/)`
	`634`	+```
	`635`	`+class Solution:`
	`636`	`+ def simplifyPath(self, path: str) -> str:`
	`637`	`+ r = []`
	`638`	`+ for s in path.split('/'):`
	`639`	`+ r = {'':r, '.':r, '..':r[:-1]}.get(s, r + [s])`
	`640`	`+ return '/' + '/'.join(r)`
	`641`	+```
`633`	`642`	`## [78. Subsets 2行](https://leetcode.com/problems/subsets/)`
`634`	`643`	```python
`635`	`644`	`class Solution:`

Comments

(0)