interviews/leetcode/two-pointers/SortColors.java at master · forkedjava/interviews · GitHub

30 lines (25 loc) · 949 Bytes

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

// 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.

// Note:

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

public class SortColors {

public void sortColors(int[] nums) {

int wall = 0;

for(int i = 0; i < nums.length; i++) {

if(nums[i] < 1) {

int temp = nums[i];

nums[i] = nums[wall];

nums[wall] = temp;

wall++;

}

}

for(int i = 0; i < nums.length; i++) {

if(nums[i] == 1) {

int temp = nums[i];

nums[i] = nums[wall];

nums[wall] = temp;

wall++;

}

}

}

}