75 Sort Colors

178 篇文章 0 订阅
160 篇文章 0 订阅

1 题目

Given an array with n objects colored red, white or blue, sort them in-place 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.

Note: You are not suppose to use the library's sort function for this problem.

Example:

Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

2 尝试解

class Solution {
public:
    void sortColors(vector<int>& nums) {
        sort(nums,0,nums.size()-1);
    }
    void sort(vector<int>& nums,int start, int end){
        int left = start;
        int right = end;
        if(left >= right) return;
        int pivot = nums[left];
        while(left < right){
            while(left<right && nums[right] >= pivot) {right--;}
            if(left < right) nums[left] = nums[right];
            while(left<right && nums[left] <= pivot) {left++;}
            if(left < right) nums[right] = nums[left];
        }  
        nums[left] = pivot;
        sort(nums,start,left-1);
        sort(nums,left+1,end);
    }
};

 3 最优解

class Solution {
public:
    void sortColors(vector<int>& A) {
            int second=A.size()-1, zero=0;
            for (int i=0; i<=second; i++) {
                while (A[i]==2 && i<second) swap(A[i], A[second--]);
                while (A[i]==0 && i>zero) swap(A[i], A[zero++]);
            }
    }
};

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值