LeetCode: First 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 consta
原创
2013-04-15 16:00:47 ·
507 阅读 ·
0 评论