@author stormma
@date 2017/11/30
生命不息,奋斗不止!
题目
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.
题目分析
题目意思很好理解,找到第一个缺失的整数,对于样例1来说 [1, 2, 0]