leetcode - First Missing Positive

来源：互联网发布：美国队长3知乎编辑：程序博客网时间：2024/05/18 00:42

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.

class Solution {public:    int firstMissingPositive(int A[], int n) {        int i,j;        for(i=0;i<n;i++){            int cur=A[i];            if(cur==i+1||cur<=0||cur>n)continue;            swap(A[i],A[cur-1]);            if(A[i]!=A[cur-1])                i--;        }        for(i=0;i<n;i++)            if(A[i]!=i+1)                 return i+1;        return n+1;    }};

0 0

LeetCode: First Missing Positive
LeetCode First Missing Positive
LeetCode: First Missing Positive
[Leetcode] First Missing Positive
[LeetCode] First Missing Positive
[Leetcode] First Missing Positive
leetcode First Missing Positive
LeetCode First Missing Positive
[leetcode] first missing positive
LeetCode: First Missing Positive
[LeetCode]First Missing Positive
LeetCode-First Missing Positive
[leetcode] First Missing Positive
[LeetCode] First Missing Positive
LeetCode - First Missing Positive
LeetCode | First Missing Positive
Leetcode: First Missing Positive
Leetcode：First Missing Positive
poj 3411 Paid Roads（dfs）
java 中文编码问题
第9周项目3输出星号图（6）
ubuntu U盘安装教程：UltraISO采用U盘安装ubuntu12.10
三分法——求凸性函数极值
leetcode - First Missing Positive
Leetcode--Subsets
poj百练 1002
记忆减退之------ASCII码表
Android 学习笔记二十二之Handler
[Python]Python学习笔记（八）——问题
leetcode - Trapping Rain Water
JNI学习积累之一 ---- 常用函数大全
leetcode_题解_Surrounded Regions