排序
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
LeetCode | Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional原创 2016-08-12 15:51:52 · 190 阅读 · 0 评论 -
LeetCode | Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.合并两个有序的单链表,题目本身并不是很难。思路1、链表插入排序从l1中选取出第一个可以插入数据的位置,将l2的数据依次插原创 2016-08-12 16:05:23 · 217 阅读 · 0 评论 -
LeetCode | Insertion Sort List
Sort a linked list using insertion sort.考察链表的插入排序一开始在root.next=head;上卡了很久,后来想一想其实这是在一条新的list上进行的操作。 每次找一个节点,并将其插入的新的list上,是所谓插入排序class Solution {public: ListNode* insertionSortList(ListNode* head原创 2016-08-12 16:55:20 · 172 阅读 · 0 评论 -
LeetCode | Sort List
Sort a linked list in O(n log n) time using constant space complexity.要求在O(nlgn)内完成链表排序。 对于单链表,可以使用归并排序。其实我一开始想的是拍成数组然后直接排序再重建… 并且这个思路比较简单写起来也没什么难度ListNode root(-1);//拍成数组,O(n)vector<int> arr;ListN原创 2016-08-12 17:11:18 · 200 阅读 · 0 评论 -
LeetCode | Find Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant space.找丢原创 2016-08-12 18:10:28 · 246 阅读 · 0 评论 -
LeetCode | Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1,原创 2016-08-12 18:35:44 · 282 阅读 · 0 评论