Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit cf3e038

Browse files
solution 70 and update README
1 parent 74f92df commit cf3e038

File tree

2 files changed

+28
-2
lines changed

2 files changed

+28
-2
lines changed

‎README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@ LeetCode
4545
|100|[Same Tree](https://leetcode-cn.com/problems/same-tree/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution100.java) | Easy
4646
|88|[Merge Sorted Array](https://leetcode-cn.com/problems/merge-sorted-array/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution88.java) | Easy
4747
|83|[Remove Duplicates from Sorted List](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution83.java) | Easy
48-
|70|[Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution70.java) | Easy
48+
|70|[Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution70.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution70.rb) | Easy
4949
|67|[Add Binary](https://leetcode-cn.com/problems/add-binary/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution67.java) | Easy
5050
|66|[Plus One](https://leetcode-cn.com/problems/plus-one/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution66.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution66.rb) | Easy
5151
|58|[Length of Last Word](https://leetcode-cn.com/problems/length-of-last-word/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution58.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution58.rb) | Easy
@@ -59,6 +59,6 @@ LeetCode
5959
|20|[Valid Parentheses](https://leetcode-cn.com/problems/valid-parentheses/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution20.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution20.rb) | Easy
6060
|14|[Longest Common Prefix](https://leetcode-cn.com/problems/longest-common-prefix/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution14.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution14.rb) | Easy
6161
|13|[Roman to Integer](https://leetcode-cn.com/problems/roman-to-integer/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution13.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution13.rb) | Easy
62-
|9|[Palindrome Number](https://leetcode-cn.com/problems/palindrome-number/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution9.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution9.rb) | Easy
62+
|9|[Palindrome Number](https://leetcode-cn.com/problems/palindrome-number/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution9.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution9.rb), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/9-solution.go) | Easy
6363
|7|[Reverse Integer](https://leetcode-cn.com/problems/reverse-integer/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution7.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution7.rb), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/7-solution.go) | Easy
6464
|1|[Two Sum](https://leetcode-cn.com/problems/two-sum/)| [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution1.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution1.rb), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/1-solution.go) | Easy

‎ruby/solution70.rb‎

Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
=begin
2+
LC#70. Climbing Stairs https://leetcode-cn.com/problems/climbing-stairs/
3+
思路:
4+
刚开始拿到题,觉得是递归的解法,尝试用递归,发现太多重复运算
5+
Google看到可以用动态规划的思想来解决
6+
既保存每次解法的结果到r[i]中
7+
每上一层阶梯,就调用上次的结果来计算
8+
=end
9+
10+
# @param {Integer} n
11+
# @return {Integer}
12+
def climb_stairs(n)
13+
return n if [1, 2, 3].include?(n)
14+
r = []
15+
r[1] = 1
16+
r[2] = 2
17+
i = 3
18+
while i <= n do
19+
r[i] = r[i - 1] + r[i - 2]
20+
i += 1
21+
end
22+
r[n]
23+
end
24+
25+
res = climb_stairs(10)
26+
p "res: #{res}"

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /