Python-剑指offer（13,14）调整数组顺序使奇数置于偶数前面,链表中倒数第k个节点

# -*- coding:utf-8 -*-
class Solution:
    def reOrderArray(self, array):
        # write code here
        i = 0
        count = 0
        while i <len(array):
            if array[i] % 2 == 0:
                array.append(array.pop(i))
                i-=1
            i+=1
            count+=1
            if count ==len(array):
                break
        return array

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def FindKthToTail(self, head, k):
        # write code here
        if not head or k == 0:
            return None
        thead = head
        for i in range(k-1):
            if thead.next != None:
                thead = thead.next
            else:
                return None
        while thead.next != None:
                head = head.next
                thead = thead.next
        return head