2016年1月19日
Lintcode Recover Rotated Sorted Array
摘要： Given arotatedsorted array, recover it to sorted array in-place.Example[4, 5, 1, 2, 3]->[1, 2, 3, 4, 5]ChallengeIn-place, O(1) extra space and O(n) ti... 阅读全文
posted @ 2016-01-19 10:01 茜茜的技术空间 阅读(302) 评论(0) 推荐(0)
Leetcode 4. Median of Two Sorted Arrays
摘要： There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should... 阅读全文
posted @ 2016-01-19 09:03 茜茜的技术空间 阅读(477) 评论(0) 推荐(0)
LintCode Merge Sorted Array II
摘要： Merge two given sorted integer arrayAandBinto a new sorted integer array.ExampleA=[1,2,3,4]B=[2,4,5,6]return[1,2,2,3,4,4,5,6]ChallengeHow can you opti... 阅读全文
posted @ 2016-01-19 04:32 茜茜的技术空间 阅读(183) 评论(0) 推荐(0)
Leetcode 80. Remove Duplicates from Sorted Array II
摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted arraynums=[1,1,1,2,2,3],Your function should re... 阅读全文
posted @ 2016-01-19 03:16 茜茜的技术空间 阅读(303) 评论(0) 推荐(0)