LintCode:数组划分

class Solution:
"""
@param nums: The integer array you should partition
@param k: As description
@return: The index after partition
"""
def partitionArray(self, nums, k):
# write your code here
# you should partition the nums by k
# and return the partition index as description
m = 0
n = len(nums) - 1
while(m < n):
while nums[m] < k and m < n:
m += 1
while nums
>= k and m < n:
n -= 1
nums[m], nums
= nums
, nums[m]
m = m + 1
n = n - 1
for i in range(len(nums)):
if nums[i] >= k:
return i
return len(nums)