LeetCode
Mind_V
这个作者很懒,什么都没留下…
展开
-
Median of Two Sorted Arrays
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 1:nums1 = [1, 3] nu原创 2017-10-02 15:03:05 · 337 阅读 · 0 评论 -
Sort List —— 归并排序
Sort a linked list in O(n log n) time using constant space complexity.算法分析1、要求时间复杂度为 O(n log n),可以考虑归并与快排;2、本文使用归并,每次将链表从中间位置切断,一分为二;3、递归2过程,直到链表长度为1;4、依次从小到大合并两个链表,最后返回排序好的链表。原创 2017-10-05 14:34:49 · 376 阅读 · 0 评论 -
Word Break Ⅱ
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. You may assume the dictionary does原创 2017-09-29 13:11:23 · 700 阅读 · 1 评论