31. Partition Array

Given 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 right
Return the partitioning index, i.e the first index i nums[i] >= k.

Example
Example 1:

Input:
[],9
Output:
0

Example 2:

Input:
[3,2,2,1],2
Output:1
Explanation:
the real array is[1,2,2,3].So return 1
Challenge
Can you partition the array in-place and in O(n)?

Notice
You 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

快排时交换元素的思路

class Solution:
    """
    @param nums: The integer array you should partition
    @param k: An integer
    @return: The index after partition
    """
    def swap(self, nums, i, j):
        temp = nums[i]
        nums[i] = nums[j]
        nums[j] = temp
        
    def partitionArray(self, nums, k):
        # write your code here
        if nums == []:
            return 0
        left = 0 
        right = len(nums) - 1
        while left < right:
            while left < right and nums[left] < k:
                left += 1
            while right > left and nums[right] >= k:
                right -= 1
            if left<right:
                self.swap(nums, left, right)
                
        if nums[left] >= k:
            return left
        return left + 1