python学习之数据结构

#堆栈,后进先出
a=[10,11,23,45,46];
a.append(1);
print(a);
a.pop();
print(a);


#队列,先进先出
from collections import deque;
queue = deque([1, 5, 4]);
queue.append(6);
queue.append(3);
queue.popleft();
print(queue);



squares=[];
for a in range(10):
    squares.append(a**2);
print(squares);

#浅拷贝
newsquares=squares.copy();
print(newsquares);

#map循环执行
arra = list(map(lambda x: x**2, range(10)));
print(arra);


d=[(x, y) for x in [1,2,3] for y in [3,1,4] if x != y];
print(d);


#等同于下面
m=[];
for i in range(10):
    for j in range(10):
        if(i!=j):
            m.append((i,j));
print(m);


z=[x**2 for x in range(6)];
print(z);


#得到[[1, 2, 8], [2, 3, 9], [3, 5, 0]]
zoom=[[1,2,3],[2,3,5],[8,9,0]];
zo=[];
for o in range(3):
    zo.append([ row[o] for row in zoom])
print(zo);

#如果用传统的循环，将会是下面这样
zooms=[[1,2,3],[2,3,5],[8,9,0]];
jms=[];
for o in range(3):
    zos=[];
    for arra in zooms:
        zos.append(arra[o]);
    jms.append(zos);         
print(jms);


#元组
t = 12345, 54321, ‘hello!‘;
print(t);