forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjinhyungrhee.java
More file actions
60 lines (49 loc) ยท 1.32 KB
/
jinhyungrhee.java
File metadata and controls
60 lines (49 loc) ยท 1.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
class Solution {
int count;
public int uniquePaths(int m, int n) {
/**
1. dfs + backtrack => Time Limit Exceeded
*/
//boolean[][] visited = new boolean[m][n];
//dfs(visited, 0, 0, m, n);
/**
2. DP
- ์ ์ฅ๋๋ ๊ฐ์ ํด๋น ์์น๊น์ง ๋๋ฌํ ์ ์๋ '๊ณ ์ ํ ๊ฒฝ๋ก์ ์'
*/
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) {
dp[i][0] = 1;
}
for (int j = 0; j < n; j++) {
dp[0][j] = 1;
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
// ์ด์ ์ ์๋ ๊ฐ๋ค์ ๋ํจ(์, ์ผ์ชฝ)
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m-1][n-1];
}
/**
1. DFS + backtrack
*/
/**
public void dfs(boolean[][] visited, int x, int y, int m, int n) {
if (x == m - 1 && y == n - 1) {
count++;
return;
}
visited[x][y] = true;
// ์ค๋ฅธ์ชฝ์ผ๋ก ์ด๋ + backtrack
if (y + 1 < n && !visited[x][y + 1]) {
dfs(visited, x, y + 1, m , n);
}
// ์๋์ชฝ์ผ๋ก ์ด๋ + backtrack
if (x + 1 < m && !visited[x + 1][y]) {
dfs(visited, x + 1, y, m, n);
}
visited[x][y] = false;
}
*/
}