找LeetCode上简单的题目来撑过30天啦(DAY10)

终於第十天了呀，我觉得要撑满30天好难，奇怪了我为甚麽要这麽勉强自己，压力爆棚压

题号：75 标题：Sort Colors 难度：Medium

Given an array nums 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.

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

You must solve this problem without using the library's sort function.

Example 1:
Input: nums = [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Example 2:
Input: nums = [2,0,1]
Output: [0,1,2]

Example 3:
Input: nums = [0]
Output: [0]

Example 4:
Input: nums = [1]
Output: [1]

Constraints:
n == nums.length
1 <= n <= 300
nums[i] is 0, 1, or 2.

我的程序码

void sortColors(int* nums, int numsSize){
    int i,f=0,s=0,t=0,temp=0;
    
    for(i=0;i<numsSize;i++){
        if(nums[i]==0){
            f++;
        }else if(nums[i]==1){
            s++;
        }else{
            t++;
        }
    }
    
    for(i=0;i<numsSize;i++){
        if(f!=0){
            nums[i] = 0;
            f--;
        }else if(s!=0){
            nums[i] = 1;
            s--;
        }else if(t!=0){
            nums[i] = 2;
            t--;
        }
    }
    return 0;
}

DAY10心得
这题一开始想用sort解决，但後来发现，要写sort还不如用无脑解，反正数字只有三种，先跑一轮计算各有几个，在把正确的数量依大小填回原本的阵列就解完了，最大的心得就是，不要小看无脑解，能达成目标的都是好解。