Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (16)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (11)
  • Network (67)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (4)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [LeetCode 75] Sort Colors

    Published Jan 26, 2022 [  TwoPointers  ]

    Problem

    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]
    

    Constraints:

    - n == nums.length
    - 1 <= n <= 300
    - nums[i] is either 0, 1, or 2.
    
    • Follow up: Could you come up with a one-pass algorithm using only constant extra space?

    TypeScript

    /**
     Do not return anything, modify nums in-place instead.
     */
    function sortColors(nums: number[]): void {
        const swap = (i: number, j: number): void => {
            let temp: number = nums[i];
            nums[i] = nums[j]
            nums[j] = temp;
        }
        let l: number = 0;
        let r: number = nums.length - 1;
        let i: number = 0;
    
        while(i <= r){
            if(nums[i] === 0) {
                swap(l, i);
                l++;
            }else if(nums[i] === 2){
                swap(r, i);
                r--;
                i--;
            }
            i++;
        }
    };
    

    Reference