u012413692的博客

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

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...