class Solution {
public:
int numWays(int n, int k) {
int prev, pprev, res;
if (n <= 0 || k <= 0)
return 0;
if (n == 1)
return k;
pprev = k;
prev = k * k;
rs = prev;
for (int i = 2; i < n; i++) {
res = pprev * (k - 1) + prev * (k - 1);
pprev = prev;
prev = res;
}
return res;
}
};
leetcode 276. 栅栏涂色
最新推荐文章于 2022-10-04 00:00:03 发布