28 lines
525 B
Dart
28 lines
525 B
Dart
/**
|
|
* File: climbing_stairs_dfs.dart
|
|
* Created Time: 2023-08-11
|
|
* Author: liuyuxin (gvenusleo@gmail.com)
|
|
*/
|
|
|
|
/* Search */
|
|
int dfs(int i) {
|
|
// Known dp[1] and dp[2], return them
|
|
if (i == 1 || i == 2) return i;
|
|
// dp[i] = dp[i-1] + dp[i-2]
|
|
int count = dfs(i - 1) + dfs(i - 2);
|
|
return count;
|
|
}
|
|
|
|
/* Climbing stairs: Search */
|
|
int climbingStairsDFS(int n) {
|
|
return dfs(n);
|
|
}
|
|
|
|
/* Driver Code */
|
|
void main() {
|
|
int n = 9;
|
|
|
|
int res = climbingStairsDFS(n);
|
|
print("There are $res solutions to climb $n stairs");
|
|
}
|