class Solution {
public:
int uniquePaths(int m, int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> vec(n, 1);
for (int i = 0; i < m - 1; ++i)
{
for (int j = 1; j < n; ++j)
{
vec[j] += vec[j - 1];
}
}
return vec[n - 1];
}
};
LeetCode-Unique Paths
最新推荐文章于 2024-08-29 16:57:08 发布