-
Notifications
You must be signed in to change notification settings - Fork 35
Expand file tree
/
Copy pathsort-colours.java
More file actions
36 lines (31 loc) · 1.06 KB
/
sort-colours.java
File metadata and controls
36 lines (31 loc) · 1.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// question - 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]
class Solution {
public void sortColors(int[] nums) {
int low=0;
int high=nums.length-1;
int mid=0;
while(mid<=high){
if(nums[mid]==0){
int temp=nums[mid];
nums[mid]=nums[low];
nums[low]=temp;
mid++;
low++;
}else if(nums[mid]==1){
mid++;
}else{
int temp=nums[mid];
nums[mid]=nums[high];
nums[high]=temp;
high--;
}
}
}
}
// Submission - https://leetcode.com/submissions/detail/710771930/