- 博客(4)
- 收藏
- 关注
RSS订阅转载 LeetCode OJ 4 Median of Two Sorted Arrays
难度：hardThere 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)).思路参考：http:
2015-07-12 19:42:06
455
原创 LeetCode OJ 81 Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the
2015-07-11 11:24:48
461
原创 LeetCode OJ 33 Search in Rotated Sorted Array
难度：hard由此可见leetcode的hard难度比较于acm是偏简单一些的。Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a tar
2015-07-06 18:21:08
534
原创 LeetCode OJ 80 Remove Duplicates from Sorted ArrayII
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi
2015-07-05 17:55:53
559
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人