![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
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,1,-5,4], the contiguous subarray [4,-1,2,1] has原创 2018-01-11 20:59:06 · 112 阅读 · 0 评论 -
找第k大的数
int findKth(vector<int> nums1, vector<int> nums2, int k){ int s1 = nums1.size(); int s2 = nums2.size(); if (s1 > s2) return findKth(nums2, nums1, k); if (s1 == 0) retur...转载 2018-05-21 09:06:22 · 256 阅读 · 0 评论