Lintcode: Partition Array

王朝学院·作者佚名  2016-05-28
窄屏简体版  字體: 小  |  中  |  大  |  超大  

Lintcode: Partition ArrayGiven an array "nums" of integers and an int "k", Partition the array (i.e move the elements in "nums") such that, * All elements < k are moved to the left * All elements >= k are moved to the rightReturn the partitioning Index, i.e the first index "i" nums[i] >= k.NoteYou should do really partition in array "nums" instead of just counting the numbers of integers smaller than k.If all elements in "nums" are smaller than k, then return "nums.length"ExampleIf nums=[3,2,2,1] and k=2, a valid answer is 1.ChallengeCan you partition the array in-place and in O(n)?

Quick Sort 一样的做法,只是有两种情况特殊处理:我第一次做的时候没有考虑到

1. all elements in nums are greater than or equal to k, l pointer never shift, should return r

2.all elements in nums are smaller than k, r pointer never shift, shoud return r+1

1 public class Solution { 2 /** 3 *@param nums: The integer array you should partition 4 *@param k: As description 5 *return: The index after partition 6 */ 7 public int partitionArray(ArrayList<Integer> nums, int k) { 8 //write your code here 9 if (nums==null || nums.size()==0) return 0;10 int l=0, r=nums.size()-1;11 while (true) {12 while (l<r && nums.get(r)>=k) {13 r--;14 }15 while (l<r && nums.get(l)<k) {16 l++;17 }18 if (l == r) break;19 swap(l, r, nums);20 }21 if (l==0 && nums.get(l)>=k) return r;22 if (r==nums.size()-1 && nums.get(l)<k) return r+1;23 return r+1;24 }25 26 public void swap(int l, int r, ArrayList<Integer> nums) {27 int temp = nums.get(l);28 nums.set(l, nums.get(r).intValue());29 nums.set(r, temp);30 }31 }

 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
© 2005- 王朝網路 版權所有 導航