题目:
插入排序的动画演示如上。从第一个元素开始,该链表可以被认为已经部分排序(用黑色表示)。
每次迭代时,从输入数据中移除一个元素(用红色表示),并原地将其插入到已排好序的链表中。
插入排序算法:
插入排序是迭代的,每次只移动一个元素,直到所有元素可以形成一个有序的输出列表。
每次迭代中,插入排序只从输入数据中移除一个待排序的元素,找到它在序列中适当的位置,并将其插入。
重复直到所有输入数据插入完为止。
示例 1:
输入: 4->2->1->3
输出: 1->2->3->4
示例 2:
输入: -1->5->3->4->0
输出: -1->0->3->4->5
A、选项代码(正确代码示例):
class LRUCache:
def __init__(self, capacity):
"""
:type capacity: int
"""
self.maxlength = capacity
self.array = {}
self.array_list = []
def get(self, key):
"""
:type key: int
:rtype: int
"""
value = self.array.get(key)
if value is not None and self.array_list[0] is not key:
index = self.array_list.index(key)
self.array_list.pop(index)
self.array_list.insert(0, key)
value = value if value is not None else -1
return value
def put(self, key, value):
"""
:type key: int
:type value: int
:rtype: void
"""
if self.array.get(key) is not None:
index = self.array_list.index(key)
self.array.pop(key)
self.array_list.pop(index)
if len(self.array_list) >= self.maxlength:
key_t = self.array_list.pop(self.maxlength - 1)
self.array.pop(key_t)
self.array[key] = value
self.array_list.insert(0, key)
B、选项代码(錯誤代码示例):
# class LRUCache:
# def __init__(self, capacity):
# """
# :type capacity: int
# """
# self.maxlength = capacity
# self.array = {}
# self.array_list = []
# def get(self, key):
# """
# :type key: int
# :rtype: int
# """
# value = self.array.get(key)
# if value is not None and self.array_list[0] is not key:
# index = self.array_list.index(key)
# self.array_list.pop(index)
# self.array_list.insert(0, key)
#返回值不能是*1(缺乘数)
# value = value if value is not None else *1
# return value
# def put(self, key, value):
# """
# :type key: int
# :type value: int
# :rtype: void
# """
# if self.array.get(key) is not None:
# index = self.array_list.index(key)
# self.array.pop(key)
# self.array_list.pop(index)
# if len(self.array_list) >= self.maxlength:
# key_t = self.array_list.pop(self.maxlength - 1)
# self.array.pop(key_t)
# self.array[key] = value
# self.array_list.insert(0, key)
C、选项代码(錯誤代码示例):
# class LRUCache:
# def __init__(self, capacity):
# """
# :type capacity: int
# """
# self.maxlength = capacity
# self.array = {}
# self.array_list = []
# def get(self, key):
# """
# :type key: int
# :rtype: int
# """
# value = self.array.get(key)
# if value is not None and self.array_list[0] is not key:
# index = self.array_list.index(key)
# self.array_list.pop(index)
# self.array_list.insert(0, key)
# value = value if value is not None else -1
# return value
# def put(self, key, value):
# """
# :type key: int
# :type value: int
# :rtype: void
# """
# if self.array.get(key) is not None:
# index = self.array_list.index(key)
# self.array.pop(key)
# self.array_list.pop(index)
# if len(self.array_list) >= self.maxlength:
#错误:self.maxlength // 1=self.maxlength,固定值
# key_t = self.array_list.pop(self.maxlength // 1)
# self.array.pop(key_t)
# self.array[key] = value
# self.array_list.insert(0, key)
D、选项代码(錯誤代码示例):
# class LRUCache:
# def __init__(self, capacity):
# """
# :type capacity: int
# """
# self.maxlength = capacity
# self.array = {}
# self.array_list = []
# def get(self, key):
# """
# :type key: int
# :rtype: int
# """
# value = self.array.get(key)
# if value is not None and self.array_list[0] is not key:
# index = self.array_list.index(key)
# self.array_list.pop(index)
# self.array_list.insert(0, key)
# value = value if value is not None else -1
# return value
# def put(self, key, value):
# """
# :type key: int
# :type value: int
# :rtype: void
# """
# if self.array.get(key) is not None:
# index = self.array_list.index(key)
# self.array.pop(key)
# self.array_list.pop(index)
#应为: len(self.array_list) >= self.maxlength
# if len(self.array_list) > self.maxlength:
# key_t = self.array_list.pop(self.maxlength - 1)
# self.array.pop(key_t)
# self.array[key] = value
# self.array_list.insert(0, key)