2019年3月25日
摘要：
```java class Solution { public int knightDialer(int N) { int cons = 1000000007; int[][] d = new int[10][N]; int[][] m = new int[][]{{4, 6, 1}, {6, 8, 阅读全文
posted @ 2019-03-25 21:53
王 帅
阅读(81)
评论(0)
推荐(0)
摘要：
S has a maximum length of 1000, and it's easy to figure out the total count of numbers combined by substring of S. Which is 1 + min(2, S) + min(2^2, S 阅读全文
posted @ 2019-03-25 21:51
王 帅
阅读(79)
评论(0)
推荐(0)
浙公网安备 33010602011771号