LintCode31 Partition Array

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
If nums = [3,2,2,1] and k=2, a valid answer is 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

public int partitionArray(int[] nums, int k) {
        // write your code here
        int start = 0, end = nums.length - 1;
        while(start <= end){
            while(start <= end && nums[start] < k){
                start++;
            }
            while(start <= end && nums[end] >= k){
                end--;
            }
            if(start <= end){
                int temp = nums[start];
                nums[start] = nums[end];
                nums[end] = temp;
                start++;
                end--;
            }
        }
        return start;
    }