update 0070

Author: xiyou

Algorithms/0070.climbing_stairs/climbing_stairs.rs

@@ -1,16 +1,37 @@
-package problem0070
+use std::collections::HashMap;
+pub struct Solution {}
 
-func climbStairs(n int) int {
-	if n < 2 {
-		return 1
-	}
+fn loop_stairs(n: i32, cacheways: &mut HashMap<i32, i32>) -> i32 {
+    match cacheways.get(&n) {
+        Some(v) => return *v,
+        None => {}
+    }
 
-	rec := make([]int, n+1)
-	rec[0], rec[1] = 1, 1
+    let mut n1: i32 = 0;
+    match cacheways.get(&n1) {
+        Some(v) => n1 = *v,
+        None => {
+            n1 = loop_stairs(n - 1, cacheways);
+            cacheways.insert(n - 1, n1);
+        }
+    }
 
-	for i := 2; i <= n; i++ {
-		rec[i] = rec[i-1] + rec[i-2]
-	}
+    let mut n2: i32 = 0;
+    match cacheways.get(&n2) {
+        Some(v) => n2 = *v,
+        None => {
+            n2 = loop_stairs(n - 2, cacheways);
+            cacheways.insert(n - 2, n2);
+        }
+    }
 
-	return rec[n]
+    return n1 + n2;
+}
+
+impl Solution {
+    pub fn climb_stairs(n: i32) -> i32 {
+        let mut cacheways: HashMap<i32, i32> = HashMap::from([(1, 1), (2, 2)]);
+
+        return loop_stairs(n, &mut cacheways);
+    }
 }

Algorithms/0070.climbing_stairs/climbing_stairs_test.rs

@@ -1,75 +1,7 @@
-package problem0070
+mod climbing_stairs;
+use climbing_stairs::Solution;
 
-import (
-	"fmt"
-	"testing"
-
-	"github.com/stretchr/testify/assert"
-)
-
-type question struct {
-	para
-	ans
-}
-
-// para 是参数
-type para struct {
-	n int
-}
-
-// ans 是答案
-type ans struct {
-	one int
-}
-
-func Test_Problem0070(t *testing.T) {
-	ast := assert.New(t)
-
-	qs := []question{
-
-		question{
-			para{
-				0,
-			},
-			ans{
-				1,
-			},
-		},
-
-		question{
-			para{
-				10,
-			},
-			ans{
-				89,
-			},
-		},
-
-		question{
-			para{
-				44,
-			},
-			ans{
-				1134903170,
-			},
-		},
-
-		question{
-			para{
-				1,
-			},
-			ans{
-				1,
-			},
-		},
-
-		// 如需多个测试，可以复制上方元素。
-	}
-
-	for _, q := range qs {
-		a, p := q.ans, q.para
-		fmt.Printf("~~%v~~\n", p)
-
-		ast.Equal(a.one, climbStairs(p.n), "输入:%v", p)
-	}
+fn main() {
+    let results = Solution::climb_stairs(4);
+    println!("{:?}", results);
 }

README.md

@@ -17,4 +17,5 @@ leetcode in rust lang.
 |2|[Add Two Numbers](./Algorithms/0002.add_two_numbers)|29%|Medium||
 |3|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest_substring_without_repeating_characters)|25%|Medium||
 |4|[Median of Two Sorted Arrays](./Algorithms/0004.median_of_two_sorted_arrays)|24%|Hard||
-|13|[Roman to Integer](./Algorithms/0013.roman_to_integer)|24%|Easy||
+|13|[Roman to Integer](./Algorithms/0013.roman_to_integer)|24%|Easy||
+|70|[Climbing Stairs](./Algorithms/0070.climbing_stairs)|24%|Easy||