Python部分
- 1.元組屬于不可變對象世曾，列表屬于可變對象脱篙，列表的很多方法不適用于元組胃惜；元組可哈希而列表不可哈希
- 2.cloudranA = ['1', '2', '3', '4', '4', '5']
- 3.cloudranA = list(set(cloudran))
cloudranA = ['4', '5', '3', '1', '2']
- 實現(xiàn)一個隊列 如下
# coding:utf-8
# 首先獲取節(jié)點柳畔，包含next指針和該節(jié)點位置上元素的值
class Node(object):
def __init__(self, val):
self.next = None
self.val = val
class Queue(object):
def __init__(self):
self.first = None
self.last = None
# 進隊操作
def enter(self, n):
# 實例節(jié)點
n = Node(n)
# 進隊之前先判斷隊列是否為空嘿歌，即判斷first是否為None
if self.first == None:
# 此時last==first==n
self.first = n
self.last = self.first
else:
# 將last的指針設置為n哀九，值設置為n
self.last.next = n
self.last = n
# 出隊
def quit(self):
if self.first == None:
return None
else:
tmp = self.first.val
self.first = self.first.next
return tmp
# 保存隊列元素到列表
def allQuit(self):
Lists = []
while self.first != None:
Lists.append(self.first.val)
self.first = self.first.next
return Lists
if __name__ == '__main__':
q = Queue()
q.enter(1)
q.enter(2)
q.enter(3)
# print(q.quit())
# print(q.quit())
# print(q.quit())
# print(q.quit())
print(q.allQuit())
