leetcode,分治法
文章平均质量分 77
piyalo
这个作者很懒,什么都没留下…
展开
-
leetcode Maximum Subarray
Description: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 [原创 2017-09-18 22:23:02 · 309 阅读 · 0 评论 -
leetcode Majorty Element
Description:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2⌋ times.You may assume that the array is non-empty and the majori原创 2017-09-14 10:47:39 · 338 阅读 · 0 评论 -
leetcode Median of Two Sorted Arrays
Description:There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example原创 2017-10-21 11:35:17 · 118 阅读 · 0 评论