![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
分治
码不停Ti
信息安全在校大学生
展开
-
【LeetCode】23. Merge k Sorted Lists 分治
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 1->1->2->3->4-&...原创 2019-12-09 20:41:51 · 318 阅读 · 0 评论 -
【Leet Code】53. Maximum Subarray
Given an integer array nums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanatio...原创 2019-10-04 18:56:30 · 380 阅读 · 0 评论