![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Divide and Conquer
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Maximum Subarray
public class Solution { public int maxSubArray(int[] nums) { if (nums == null) { return -1; } int result = Integer.MIN_VALUE; int sum = 0;原创 2015-07-29 15:31:52 · 197 阅读 · 0 评论 -
Leetcode#4||Median of Two Sorted Arrays
public class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int len1 = nums1.length; int len2 = nums2.length; if ((len1 + len2) % 2 ==原创 2015-08-11 10:44:40 · 215 阅读 · 0 评论 -
Leetcode#53||Maximum Subarray
public class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int length = nums.length;原创 2015-08-17 10:21:32 · 199 阅读 · 0 评论