feat: add solutions to lcof problem: No.10 - ||

面试题 10- II. 青蛙跳台阶问题
yjm123456789yjm · Jan 29, 2022 · 38098ed · 38098ed
1 parent d196f0e
commit 38098ed
Show file tree

Hide file tree

Showing 3 changed files with 44 additions and 0 deletions.
diff --git a/lcof/面试题10- II. 青蛙跳台阶问题/README.md b/lcof/面试题10- II. 青蛙跳台阶问题/README.md
@@ -105,6 +105,33 @@ func numWays(n int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numWays(n: number): number {
+    let a = 0;
+    let b = 1;
+    for (let i = 0; i < n; i++) {
+        [a, b] = [b, (a + b) % 1000000007];
+    }
+    return b;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_ways(n: i32) -> i32 {
+        let mut tup = (0, 1);
+        for _ in 0..n {
+            tup = (tup.1, (tup.0 + tup.1) % 1000000007);
+        }
+        tup.1
+    }
+}
+```
+
 ### **...**
 
 ```

diff --git a/lcof/面试题10- II. 青蛙跳台阶问题/Solution.rs b/lcof/面试题10- II. 青蛙跳台阶问题/Solution.rs
@@ -0,0 +1,9 @@
+impl Solution {
+    pub fn num_ways(n: i32) -> i32 {
+        let mut tup = (0, 1);
+        for _ in 0..n {
+            tup = (tup.1, (tup.0 + tup.1) % 1000000007);
+        }
+        tup.1
+    }
+}
diff --git a/lcof/面试题10- II. 青蛙跳台阶问题/Solution.ts b/lcof/面试题10- II. 青蛙跳台阶问题/Solution.ts
@@ -0,0 +1,8 @@
+function numWays(n: number): number {
+    let a = 0;
+    let b = 1;
+    for (let i = 0; i < n; i++) {
+        [a, b] = [b, (a + b) % 1000000007];
+    }
+    return b;
+}