20191026-leetcode-62不一樣路徑(簡單排列)

class Solution { public: int uniquePaths(int m, int n) { if(m==0||n==0||m+n==1) return 0; return C(m-1,m+n-2); } int C(int m,int n) { long long res=1

>>阅读原文<<