![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
donghaiwanghaha
这个作者很懒,什么都没留下…
展开
-
和为S的正整数序列
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); while (true) { int N = scan.nextInt();原创 2016-10-10 14:41:22 · 259 阅读 · 0 评论 -
连续子数组的最大和(剑指Offer 面试题31)
public class Solution { public int FindGreatestSumOfSubArray(int[] array) { if (array.length == 0) { return 0; } int maxSum = Integer.MIN_VALUE; for (int原创 2016-10-11 20:44:32 · 133 阅读 · 0 评论