https://blog.youkuaiyun.com/markpenzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/markpen/article/details/71157306https://blog.youkuaiyun.com/markpen/article/details/71157306markpenThu, 04 May 2017 01:46:07 +0800https://blog.youkuaiyun.com/markpen/article/details/69664701https://blog.youkuaiyun.com/markpen/article/details/69664701markpenSat, 08 Apr 2017 08:59:14 +0800https://blog.youkuaiyun.com/markpen/article/details/68955565https://blog.youkuaiyun.com/markpen/article/details/68955565markpenMon, 03 Apr 2017 01:28:33 +0800https://blog.youkuaiyun.com/markpen/article/details/68063002https://blog.youkuaiyun.com/markpen/article/details/68063002markpenWed, 29 Mar 2017 12:13:25 +0800 tickets) { if(tickets.size() == 0) return re; for(int i = 0; i < tickets.s]]>https://blog.youkuaiyun.com/markpen/article/details/67634410https://blog.youkuaiyun.com/markpen/article/details/67634410markpenTue, 28 Mar 2017 12:29:14 +0800 upper sumb[K] - suma[I] > lower，那么L - K之间的和都满足要求。 class Solution { public: int countRangeSum(vector& nums, int lower, int upper) ]]>https://blog.youkuaiyun.com/markpen/article/details/67162818https://blog.youkuaiyun.com/markpen/article/details/67162818markpenTue, 28 Mar 2017 00:44:06 +0800=0; -]]>https://blog.youkuaiyun.com/markpen/article/details/66968196https://blog.youkuaiyun.com/markpen/article/details/66968196markpenMon, 27 Mar 2017 09:48:13 +0800 kSmallestPairs(vector& nums1, vector& nums2, int k) { vector> mp; for(int i = 0; i < nums1.size]]>https://blog.youkuaiyun.com/markpen/article/details/66950987https://blog.youkuaiyun.com/markpen/article/details/66950987markpenMon, 27 Mar 2017 04:47:09 +0800https://blog.youkuaiyun.com/markpen/article/details/61545751https://blog.youkuaiyun.com/markpen/article/details/61545751markpenSun, 12 Mar 2017 02:42:40 +0800https://blog.youkuaiyun.com/markpen/article/details/61413260https://blog.youkuaiyun.com/markpen/article/details/61413260markpenSat, 11 Mar 2017 09:35:33 +0800https://blog.youkuaiyun.com/markpen/article/details/61407256https://blog.youkuaiyun.com/markpen/article/details/61407256markpenSat, 11 Mar 2017 08:19:03 +0800https://blog.youkuaiyun.com/markpen/article/details/60765002https://blog.youkuaiyun.com/markpen/article/details/60765002markpenTue, 07 Mar 2017 15:11:58 +0800https://blog.youkuaiyun.com/markpen/article/details/60762356https://blog.youkuaiyun.com/markpen/article/details/60762356markpenTue, 07 Mar 2017 13:47:15 +0800https://blog.youkuaiyun.com/markpen/article/details/60761259https://blog.youkuaiyun.com/markpen/article/details/60761259markpenTue, 07 Mar 2017 12:56:36 +0800& board) { h = w = 0; h = board.size(); if(h) w = board[0].size(); for(int i = 0]]>https://blog.youkuaiyun.com/markpen/article/details/59483509https://blog.youkuaiyun.com/markpen/article/details/59483509markpenThu, 02 Mar 2017 11:30:07 +0800https://blog.youkuaiyun.com/markpen/article/details/59407060https://blog.youkuaiyun.com/markpen/article/details/59407060markpenThu, 02 Mar 2017 06:01:19 +0800https://blog.youkuaiyun.com/markpen/article/details/54628453https://blog.youkuaiyun.com/markpen/article/details/54628453markpenFri, 20 Jan 2017 04:12:56 +0800 subsetsWithDup(vector& nums) { int mark = pow(2.0, nums.size()); vector in; int iniin = 1;]]>https://blog.youkuaiyun.com/markpen/article/details/54570877https://blog.youkuaiyun.com/markpen/article/details/54570877markpenMon, 16 Jan 2017 08:14:03 +0800https://blog.youkuaiyun.com/markpen/article/details/54561847https://blog.youkuaiyun.com/markpen/article/details/54561847markpenSun, 15 Jan 2017 14:45:38 +0800 reconstructQ]]>https://blog.youkuaiyun.com/markpen/article/details/54405268https://blog.youkuaiyun.com/markpen/article/details/54405268markpenFri, 13 Jan 2017 08:25:00 +0800