leetcode 两道交换问题

41. 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 constant space.

题意：寻找数组中第一个未出现的正整数

思路：交换数组元素，使得数组中第i位存放数值(i+1)，数字不符合1~n不用处理。最后遍历数组，寻找第一个不符合此要求的元素，返回其下标。

代码：

class Solution_41 {
public:
    int firstMissingPositive(vector<int> &nums) {
        if (nums.size() == 0) return 1;
        int n=nums.size();
        for (int i = 0; i < n; ) {
            if (nums[i]!=i+1&&nums[i]-1>=0&&nums[i]-1<n&&nums[nums[i]-1]!=nums[i]){
                swap(nums[i],nums[nums[i]-1]);
            }
            else i++;
        }
        for (int i = 0; i < n; ++i) {
            if(nums[i]!=i+1) return i+1;
        }
        return n+1;
    }
};

75. Sort Colors

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.

题意：将只含有0，1，2三个数的数组排序，要求只遍历一遍数组。

思路：记录0的结束位置end0和2的开始位置begin2，遇到0则交换至end0+1，遇到2则交换至begin2-1。

代码：

class Solution_75 {
public:
    void sortColors(vector<int> &nums) {
        int n = nums.size();
        int end0 = -1, begin2 = n;
        for (int i = 0; i < begin2;) {
            if (nums[i] == 0) {
                swap(nums[i], nums[end0 + 1]);
                end0++;
                i++;
            } else if (nums[i] == 1) {
                i++;
            } else {
                swap(nums[i], nums[begin2 - 1]);
                begin2--;
            }
        }
    }
};