码迷,mamicode.com
首页 >  
搜索关键字:least    ( 1796个结果
LeetCode Maximum Subarray
1.题目Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [?2,1,?3,4,?1,2,1,?5,4],the contiguous subarray [4,?1,2,1] has...
分类:其他好文   时间:2015-03-12 11:38:49    阅读次数:120
hdu_1203
原来这叫背包.. 1 #include 2 #include 3 4 // dp[i] is the possibility he can get at least 1 offer when i yuan have been taken. 5 int n, m, a[10010]; 6 do...
分类:其他好文   时间:2015-03-10 21:02:11    阅读次数:119
Leetcode 53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,...
分类:其他好文   时间:2015-03-10 19:07:17    阅读次数:126
杭电1019-Least Common Multiple
#includeint gcd(int a,int b);int main(){ int n,m,a,b,i,sum;//sum是最小公倍数 scanf("%d",&n); while(n--) { scanf("%d",&m); sum=1;//sum=1 for(i=1;i<=m;i++) { ...
分类:其他好文   时间:2015-03-10 19:04:59    阅读次数:113
Avoid memory leaks on Android
Android applications are, at least on the T-Mobile G1, limited to 16 MB of heap. It’s both a lot of memory for a phone and yet very little for what so...
分类:移动开发   时间:2015-03-10 11:51:47    阅读次数:202
LeetCode 笔记26 Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the...
分类:其他好文   时间:2015-03-08 21:30:59    阅读次数:155
F - Tree
DescriptionYou are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of ...
分类:其他好文   时间:2015-03-08 12:59:07    阅读次数:147
Maximum Subarray -- leetcode
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,1,?5,4], the contiguous subarray [4,?1,2,1] ha...
分类:其他好文   时间:2015-03-08 11:49:56    阅读次数:140
LeetCode --- 53. Maximum Subarray
题目链接:Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1,2,1,?5,4], the contiguous s...
分类:其他好文   时间:2015-03-07 11:38:51    阅读次数:198
[MODx] Build a CMP (Custom manager page) using MIGX in MODX 2.3 -- 1
BIG FUCK for MODxMODx document is not that good ... at least in my opint of view. I spend hours to search martirals to find out how to build a CMP by ...
分类:其他好文   时间:2015-03-05 20:55:44    阅读次数:611
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!