First Missing Positive

一、学习要点：
这篇博客讲的比较好：https://www.cnblogs.com/fstang/p/3754549.html
不断填坑挖坑，填坑是用应有的值，挖去不匹配的值；
二、代码：

class Solution
{int firstMissingPositive(int A[],int n){for(i=0;i<n;i++){if(A[i]==i+1){continue;}int idx=A[i];if(idx>0&&idx<=n&&A[idx-1]!=idx){int temp=A[idx-1];A[idx-1]=idx;idx=temp;}}}
};

First Missing Positive相关推荐

41-First Missing Positive
[题目] Given an unsorted integer array, find the first missing positive integer. For example, Given [1 ...
LeetCode First Missing Positive
Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] ...
Lintcode189 First Missing Positive solution 题解
[题目描述] Given an unsorted integer array, find the first missing positive integer. 给出一个无序的整数数组,找出其中没有出 ...
41. First Missing Positive
题目: Given an unsorted integer array, find the first missing positive integer. For example, Given [1, ...
leetcode 41. First Missing Positive 1
题目要求 Given an unsorted integer array, find the first missing positive integer.For example, Given [1, ...
LeetCode题解41.First Missing Positive
41. First Missing Positive Given an unsorted integer array, find the first missing positive integer. ...
[LeetCode] First Missing Positive
Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] ...
leetCode 41.First Missing Positive (第一个丢失的正数) 解题思路和方法
First Missing Positive Given an unsorted integer array, find the first missing positive integer. For ...
LeetCode: First Missing Positive 解题报告
Q: Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2 ...
【排序+难题】LeetCode 41. First Missing Positive
LeetCode 41. First Missing Positive 本博客转载自:[1]http://www.cnblogs.com/grandyang/p/4395963.html [2]htt ...

First Missing Positive

First Missing Positive相关推荐

最新文章

热门文章