【dp】leetcode 276. Paint Fence

【dp】leetcode 276. Paint Fence java class Solution { public int numWays(int n, int k) { if(n==0||k==0) return 0; int[][][] dp = new int[n+1][k][2]; for(int j=0;j<k;j++){

>>阅读原文<<