求数组中第K小的数（利用快排思想有bug）

def findKthSmallest(self, nums, k):
    if nums:
        pos = self.partition(nums, 0, len(nums) - 1)
    if k > pos + 1:
        return self.findKthSmallest(nums[pos + 1:], k - pos - 1)
    elif k < pos + 1:
        return self.findKthSmallest(nums[:pos], k)
    else:
        return nums[pos]


def partition(self, nums, l, r):
    low = l
    while l < r:
        if nums[l] < nums[r]:
            nums[l], nums[low] = nums[low], nums[l]
            low += 1
        l += 1
    nums[low], nums[r] = nums[r], nums[low]
    return low