标签:sort right nums colors Output Input 排序 Example left
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.
Here, we will use the integers 0
, 1
, and 2
to represent the color red, white, and blue respectively.
Follow up:
- Could you solve this problem without using the library's sort function?
- Could you come up with a one-pass algorithm using only
O(1)
constant space?
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]
思路:不是比较元素,是比较index。元素只要跟基准比较就行了。
中间的if不动了,此时还是left <= right。双方换一下
class Solution { public void sortColors(int[] nums) { int left = 0; int right = nums.length - 1; //和1比较 while (left <= right) { while (left < right && nums[left] < 1) { left++; } while (left <= right && nums[right] >= 1) { right--; } if (left <= right) { int temp = nums[left]; nums[left] = nums[right]; nums[right] = temp; left++; right--; } } //重设left right left = 0; right = nums.length - 1; //和2比较 while (left <= right) { while (left < right && nums[left] < 2) { left++; } while (left <= right && nums[right] >= 2) { right--; } if (left <= right) { int temp = nums[left]; nums[left] = nums[right]; nums[right] = temp; left++; right--; } } } }View Code
标签:sort,right,nums,colors,Output,Input,排序,Example,left 来源: https://www.cnblogs.com/immiao0319/p/13872345.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。