https://blog.youkuaiyun.com/dingzuoerzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/dingzuoer/article/details/48211311https://blog.youkuaiyun.com/dingzuoer/article/details/48211311dingzuoerFri, 04 Sep 2015 18:24:26 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46521559https://blog.youkuaiyun.com/dingzuoer/article/details/46521559dingzuoerTue, 16 Jun 2015 18:00:27 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46503571https://blog.youkuaiyun.com/dingzuoer/article/details/46503571dingzuoerMon, 15 Jun 2015 14:36:41 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46368373https://blog.youkuaiyun.com/dingzuoer/article/details/46368373dingzuoerThu, 04 Jun 2015 22:25:36 +0800& nums, int val) { //找出最大的下标i使nums[i] == val int N = nums.size(); if (N == 0) return -1; int l]]>https://blog.youkuaiyun.com/dingzuoer/article/details/46364913https://blog.youkuaiyun.com/dingzuoer/article/details/46364913dingzuoerThu, 04 Jun 2015 17:36:03 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46124853https://blog.youkuaiyun.com/dingzuoer/article/details/46124853dingzuoerThu, 28 May 2015 16:19:46 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46124329https://blog.youkuaiyun.com/dingzuoer/article/details/46124329dingzuoerThu, 28 May 2015 15:47:38 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46123695https://blog.youkuaiyun.com/dingzuoer/article/details/46123695dingzuoerThu, 28 May 2015 15:10:25 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46120299https://blog.youkuaiyun.com/dingzuoer/article/details/46120299dingzuoerThu, 28 May 2015 11:45:19 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46048397https://blog.youkuaiyun.com/dingzuoer/article/details/46048397dingzuoerWed, 27 May 2015 16:21:46 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46047283https://blog.youkuaiyun.com/dingzuoer/article/details/46047283dingzuoerWed, 27 May 2015 15:18:55 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46043557https://blog.youkuaiyun.com/dingzuoer/article/details/46043557dingzuoerWed, 27 May 2015 10:44:06 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/46006163https://blog.youkuaiyun.com/dingzuoer/article/details/46006163dingzuoerTue, 26 May 2015 11:54:11 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/45818191https://blog.youkuaiyun.com/dingzuoer/article/details/45818191dingzuoerMon, 18 May 2015 11:36:33 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/45670197https://blog.youkuaiyun.com/dingzuoer/article/details/45670197dingzuoerTue, 12 May 2015 15:31:43 +0800 0，则dp[i+1] = dp[i]+a[i+1]。 若dp[i] <= 0， 则dp[i+1] = a[i+1]。 一维的如上求解，然后我们试着将二维的转化成一维，我们将子矩]]>https://blog.youkuaiyun.com/dingzuoer/article/details/45504269https://blog.youkuaiyun.com/dingzuoer/article/details/45504269dingzuoerTue, 05 May 2015 16:30:42 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/45479009https://blog.youkuaiyun.com/dingzuoer/article/details/45479009dingzuoerMon, 04 May 2015 12:05:46 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/45195883https://blog.youkuaiyun.com/dingzuoer/article/details/45195883dingzuoerWed, 22 Apr 2015 15:35:16 +0800https://blog.youkuaiyun.com/dingzuoer/article/details/44804689https://blog.youkuaiyun.com/dingzuoer/article/details/44804689dingzuoerWed, 01 Apr 2015 11:39:21 +0800 >& board,int r,int c){ if(r == 8&&c == 9) //数独完成]]>https://blog.youkuaiyun.com/dingzuoer/article/details/44802767https://blog.youkuaiyun.com/dingzuoer/article/details/44802767dingzuoerWed, 01 Apr 2015 09:50:53 +0800 &num,int lef]]>