12章後半

from collections import deque
dict1 = {'One':1, 'Two':2, 'Three':3}
dict1['Three']=4
print(dict1)
dict1.update({'Four':4})
print(dict1)
dict1.pop('One')
print(dict1)
list1 = dict1.keys()
print(list1)
dist2 = dict1.values()
print(dist2)
stack=[]
stack.append(1)
stack.append(2)
stack.append(3)
stack.pop()
print(stack)
print("本程式實現堆疊")
n=0
stack=[]
while True:
    print("-----------------------------")
    print("stack operation")
    print("(1) push")
    print("(2) pop")
    print("(3) Display")
    print("(4) quit")
    print("-----------------------------")
    choice=int(input("Enter your choice:"))
    if choice==1:
        key =eval(input("Push key:"))
        stack.append(key)
        n=n+1
    elif choice==2:
        if n>0:
            key=stack.pop()
            print("pop key:",key)
            n=n-1
        else:
            print("stack is empty")
    elif choice==3:
        print("stack:",stack)
    else:
        break
queue = deque([])
queue.append(1)
queue.append(2)
queue.append(3)
print(queue.popleft(),queue)
print("本程式實現佇列")
n = 0
queue = []
while True:
    print("-----------------------------")
    print("Queue operation")
    print("(1) Enqueue")
    print("(2) Dequeue")
    print("(3) Display")
    print("(4) quit")
    print("-----------------------------")
    Choice=int(input("Enter your choice:"))
    if Choice==1:
        key=eval(input("Enqueue key: "))
        queue.append(key)
        n=n+1
    elif Choice==2:
        if n>0:
            key=queue.pop()
            print("Dequeue key:",key)
            n=n-1
        else:
            print("Queue is empty")
    elif Choice == 3:
        print("Queue:",queue)
    else:
        break
a = [1,2,3,4]
b = [2,4,3,1]
c = [0 for i in range(4)]
for i in range(4):
    c[i] = a[i]+b[i]
print("向量加法",c)
scalar = 3
for i in range(4):
    c[i] = scalar * a[i]
print("純量加法",c)
def matrix_addition(A,B):
    n = len(A)
    c = [[0 for j in range(n)] for i in range(n)]
    for i in range (n):
        for j in range (n):
            c[i][j] = A[i][j] + B[i][j]
    return c
def matrix_mutiplication(A,B):
    n = len(A)
    c = [[0 for j in range(n)] for i in range(n)]
    for i in range (n):
        for j in range (n):
            for k in range (n):
                c[i][j] = c[i][j]+A[i][k]*B[k][j]
    return c
A =[[1,2],[3,4]]
B =[[2,4],[3,1]]
c = matrix_addition(A,B)
print("矩陣加法:",c)
c = matrix_mutiplication(A,B)
print("矩陣乘法:",c)