Commit 4728ebf

author

钱毓婷

committed

feat: add solution of Climbing Stairs(070) with javascript.

1 parent eaa2c1c commit 4728ebfCopy full SHA for 4728ebf

File tree

+36

-1

lines changed

+36

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -70,7 +70,7 @@`
`70`	`70`	`\| [067][067-question] \| [Add Binary][067-tips] \| [Easy][E] \| [✅][067-java] \| [✅][067-js] \| [✅][067-kotlin] \|`
`71`	`71`	`\| [068][068-question] \| [Text Justification][068-tips] \| [Hard][H] \| [✅][068-java] \| \| \|`
`72`	`72`	`\| [069][069-question] \| [Sqrt(x)][069-tips] \| [Easy][E] \| [✅][069-java] \| [✅][069-js] \| [✅][069-kotlin] \|`
`73`		`-\| [070][070-question] \| [Climbing Stairs][070-tips] \| [Easy][E] \| [✅][070-java] \| \| [✅][070-kotlin] \|`
	`73`	`+\| [070][070-question] \| [Climbing Stairs][070-tips] \| [Easy][E] \| [✅][070-java] \| [✅][070-js] \| [✅][070-kotlin] \|`
`74`	`74`	`\| [083][083-question] \| [Remove Duplicates from Sorted List][083-tips] \| [Easy][E] \| [✅][083-java] \| \| [✅][083-kotlin] \|`
`75`	`75`	`\| [088][088-question] \| [Merge Sorted Array][088-tips] \| [Easy][E] \| [✅][088-java] \| \| [✅][088-kotlin] \|`
`76`	`76`	`\| [100][100-question] \| [Same Tree][100-tips] \| [Easy][E] \| [✅][100-java] \| \| [✅][100-kotlin] \|`
`@@ -376,6 +376,7 @@`
`376`	`376`	`[066-js]: ./src/_066/Solution.js`
`377`	`377`	`[067-js]: ./src/_067/Solution.js`
`378`	`378`	`[069-js]: ./src/_069/Solution.js`
	`379`	`+[070-js]: ./src/_070/Solution.js`
`379`	`380`	`[226-js]: ./src/_226/Solution.js`
`380`	`381`	`[561-js]: ./src/_561/Solution.js`
`381`	`382`	`[643-js]: ./src/_643/Solution.js`

Lines changed: 16 additions & 0 deletions

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -73,6 +73,24 @@ class Solution {`
`73`	`73`	`}`
`74`	`74`	```
`75`	`75`
	`76`	+```JavaScript
	`77`	`+/**`
	`78`	`+ * @param {number} n`
	`79`	`+ * @return {number}`
	`80`	`+ */`
	`81`	`+var climbStairs = function(n) {`
	`82`	`+ if(n == 1) {return 1}`
	`83`	`+ if(n == 2) {return 2}`
	`84`	`+`
	`85`	`+ var step1 = 1, step2 = 2, x;`
	`86`	`+ for(var i = 2 ; i < n; i++) {`
	`87`	`+ x = step2`
	`88`	`+ step2 += step1`
	`89`	`+ step1 = x`
	`90`	`+ }`
	`91`	`+ return step2`
	`92`	`+};`
	`93`	+```
`76`	`94`	`## 结语`
`77`	`95`
`78`	`96`	`如果你同我们一样热爱数据结构、算法、LeetCode,可以关注我们 GitHub 上的 LeetCode 题解:[LeetCode-Solution][ls]`

Comments

(0)