package leetcode; public class demo_75 { public void sortColors(int[] nums) { int left=0; int right=nums.length-1; int swap; for(int i=0;i<=right;i++) { while(i<=right&&nums[i]==2) { swap=nums[i]; nums[i]=nums[right]; nums[right]=swap; right=right-1; } if(nums[i]==0) { swap=nums[left]; nums[left]=nums[i]; nums[i]=swap; left=left+1; } } for(int i:nums) {System.out.print(i+" ");} } public static void main(String[] args) { // TODO Auto-generated method stub demo_75 d75=new demo_75(); int nums[]= {2,0,2,1,1,0}; d75.sortColors(nums); } }
原文:https://www.cnblogs.com/Yshun/p/14853305.html