Add files via upload

Author: kuwan2e

BeiJingtu.py

@@ -0,0 +1,30 @@
+import tu
+import json
+
+def outputVexSetNumToCities(vexset):
+    To = []
+    for vex in vexset:
+        To.append(cities[str(vex)])
+    print(To)
+    return To
+def outputArcSetNumToCities(arcset):
+    To = []
+    for arc in arcset:
+        To.append((cities[str(arc[0])],cities[str(arc[1])]))
+    print(To)
+    return To
+#print(dfsvexset,dfsarcset)
+img = tu.initimg("image.json")
+f = open("cities.json",encoding='UTF-8')
+cities = json.load(f)
+#print(cities)
+dfsvexset,dfsarcset = tu.dfs(img)
+bfsvexset,bfsarcset = tu.bfs(img)
+print("深度优先遍历得到的vexset为",end="：")
+outputVexSetNumToCities(dfsvexset)
+print("深度优先遍历得到的arcset为",end="：")
+outputArcSetNumToCities(dfsarcset)
+print("广度优先遍历得到的vexset为",end="：")
+outputVexSetNumToCities(bfsvexset)
+print("广度优先遍历得到的arcset为",end="：")
+outputArcSetNumToCities(bfsarcset)

LISP.py

@@ -0,0 +1,47 @@
+class Stack(object):
+    def __init__(self):
+        self.items = []
+    def is_empty(self):
+        return self.items == []
+    def peek(self):
+        return self.items[len(self.items) - 1]
+    def size(self):
+        return len(self.items)
+    def push(self, item):
+        self.items.append(item)
+    def pop(self):
+        return self.items.pop()
+    def delete(self):
+        self.items = []
+OPTR = Stack()
+OPND = Stack()
+intNumber = []
+for n in range(10):
+    intNumber.append(str(n))
+def isInt(x):
+    for n in intNumber:
+        if(x == n): return 1
+    return 0
+def LISPadd(str):
+    sum = 0
+    i = 0
+    s = list(str)
+    while(True):
+        if(s[i] != ')'):
+            OPTR.push(s[i])
+            #print(OPTR.items)
+        else:
+            OPND = Stack()
+            while(OPTR.peek() != '+'):
+                OPND.push(OPTR.pop())
+            for t in OPND.items:
+                sum += int(t)
+            OPTR.pop()
+            OPTR.pop()
+        if(OPTR.is_empty() == True):
+            break
+        i += 1
+    return sum
+a = "(+(+(+12)(+34))(+(+56)(+78)))"
+b = "(+45)"
+print(LISPadd(a))

biaodashi.py

@@ -0,0 +1,62 @@
+class Stack(object):
+    def __init__(self):
+        self.items = []
+    def is_empty(self):
+        return self.items == []
+    def peek(self):
+        return self.items[len(self.items) - 1]
+    def size(self):
+        return len(self.items)
+    def push(self, item):
+        self.items.append(item)
+    def pop(self):
+        return self.items.pop()
+    def delete(self):
+        self.items = []
+def operate(a,o,b):
+    if(o == '*'): return a*b
+    if(o == '/'): return b/a
+    if(o == '+'): return a+b
+
+a = input("输入表达式:")
+b = list(a)
+b.insert(0,'(')
+b.append(')')
+print(b)
+OPTR = Stack()
+Number = Stack()
+operator = Stack()
+i = 0
+while(i < len(b)):
+    NumberTemp = []
+    if(b[i] == ')'):
+        while(operator.peek() != '('):
+            Number.push(operate(Number.pop(), operator.pop(), Number.pop()))
+        operator.pop()
+        #Number.push(operate(Number.pop(),operator.pop(),Number.pop()))
+
+        #print(Number.peek())
+    else:
+        if(b[i] == '*' or b[i] == '/' or b[i] == '+' or b[i] == '-' or b[i] == '('):
+            operator.push(b[i])
+
+        else:
+            while (b[i] != '*' and b[i] != '/' and b[i] != '+' and b[i] != '-' and b[i] != '(' and b[i] != ')'):
+                NumberTemp.append(b[i])
+                i += 1
+                #print(NumberTemp)
+            Nt = "".join(NumberTemp)
+            Number.push(float(Nt))
+            i-=1
+
+            #print("运算符栈为：" + operator.peek())
+            #print("运算数栈为：" , Number.peek())
+            if (operator.peek() == '*' or operator.peek() == '/'):
+                Number.push(operate(Number.pop(), operator.pop(), Number.pop()))
+            elif (operator.peek() == '-'):
+                Number.push(-Number.pop())
+                operator.pop()
+                operator.push('+')
+    i+=1
+
+print(Number.peek())

biaodashi2.py

@@ -0,0 +1,153 @@
+class Stack(object):
+    def __init__(self):
+        self.items = []
+    def is_empty(self):
+        return self.items == []
+    def peek(self):
+        return self.items[len(self.items) - 1]
+    def size(self):
+        return len(self.items)
+    def push(self, item):
+        self.items.append(item)
+    def pop(self):
+        return self.items.pop()
+    def delete(self):
+        self.items = []
+def operate(a,o,b):
+    if(o == '*'): return a*b
+    elif(o == '/'): return a/b
+    elif(o == '+'): return a+b
+    elif(o == '-'): return a-b
+def precede(a,b):
+    if(a != '#'):
+        if(a == '+' or a == '-'):
+            if(b == '+' or b == '-' or b == ')' or b == '#'):
+                return '>'
+            elif(b == '*' or b == '/' or b == '('):
+                return '<'
+        elif(a == '*' or a == '/'):
+            if(b == '('):
+                return '<'
+            else: return '>'
+        elif(a == '('):
+            if(b == ')'):
+                return '='
+            else: return '<'
+        elif(a == ')'):
+            return '>'
+    elif(a == '#'):
+        if(b == '#'): return '='
+        else:
+            return '<'
+intNumber = []
+for n in range(10):
+    intNumber.append(str(n))
+def isInt(x):
+    for n in intNumber:
+        if(x == n): return 1
+    return 0
+def jisuan(s):
+    #a = input("输入表达式:" + "\n")
+    b = list(s)
+    b.append('#')
+    #print(b)
+    OPTR = Stack()
+    Number = Stack()
+    operator = Stack()
+    operator.push('#')
+    i = 0
+    NumberTemp = []
+    while (True):
+        print("本次输入为：", b[i],end='\t')
+        print("运算符栈为：", operator.items, end='\t')
+        if (b[i] == '*' or b[i] == '/' or b[i] == '+' or b[i] == '-' or b[i] == '(' or b[i] == ')' or b[i] == '#'):
+            # print("nt",NumberTemp)
+            if (NumberTemp != []):
+                Nt = "".join(NumberTemp)
+                Number.push(float(Nt))
+                NumberTemp = []
+            if (precede(operator.peek(), b[i]) == '<'):
+                operator.push(b[i])
+            elif (precede(operator.peek(), b[i]) == '='):
+                x = operator.pop()
+            elif (precede(operator.peek(), b[i]) == '>'):
+                theta = operator.pop()
+                x2 = Number.pop()
+                x1 = Number.pop()
+                print("运算", x1, theta, x2, end='\t')
+                Number.push(operate(x1, theta, x2))
+                i -= 1
+        elif (isInt(b[i]) == 1 or b[i] == '.'):
+            NumberTemp.append(b[i])
+        elif(b[i] <= 'z' and b[i] >= 'A'):
+            cTemp = b[i]
+            b[i] = input("输入" + b[i] + "的值\n")
+            for j in range(i,len(b)):
+                if(b[j] == cTemp):
+                    b[j] = b[i]
+            NumberTemp.append(b[i])
+        else:
+            NumberTemp.append(b[i])
+        # if (b[i] != '#'):
+        print("运算数栈为：", Number.items, end='\n')
+
+        i += 1
+        # elif(b[i] == '#'):
+        #
+        if (operator.peek() == '#' and b[i] == '#'):
+            print("本次输入为：", b[i],end='\t')
+            print("运算符栈为：", operator.items, end='\t')
+            print("运算数栈为：", Number.items, end='\n')
+
+            break
+    if(Number.is_empty() != True): print("\n\n运算结果为：", Number.peek())
+    else: print("\n\n运算结果为：", float("".join(NumberTemp)))
+'''a = input("输入表达式:" + "\n")
+b = list(a)
+b.append('#')
+print(b)
+OPTR = Stack()
+Number = Stack()
+operator = Stack()
+operator.push('#')
+i = 0
+NumberTemp = []
+while(True):
+    print("运算符栈为：",operator.items,end='\t')
+    if (b[i] == '*' or b[i] == '/' or b[i] == '+' or b[i] == '-' or b[i] == '(' or b[i] == ')' or b[i] == '#'):
+        #print("nt",NumberTemp)
+        if(NumberTemp != []):
+            Nt = "".join(NumberTemp)
+            Number.push(float(Nt))
+            NumberTemp = []
+        if(precede(operator.peek(),b[i]) == '<'):
+            operator.push(b[i])
+        elif(precede(operator.peek(),b[i]) == '='):
+            x = operator.pop()
+        elif(precede(operator.peek(),b[i]) == '>'):
+            theta = operator.pop()
+            x2 = Number.pop()
+            x1 = Number.pop()
+            print("运算",x1,theta,x2,end='\t')
+            Number.push(operate(x1,theta,x2))
+            i -= 1
+    elif(isInt(b[i]) == 1 or b[i] == '.'):
+        NumberTemp.append(b[i])
+    else:
+        b[i] = input("输入" + b[i] + "的值\n")
+        NumberTemp.append(b[i])
+    #if (b[i] != '#'):
+    print("运算数栈为：", Number.items, end='\t')
+    print("本次输入为：", b[i])
+    i += 1
+    #elif(b[i] == '#'):
+    #
+    if(operator.peek() == '#' and b[i] == '#'):
+        print("运算符栈为：", operator.items, end='\t')
+        print("运算数栈为：",Number.items,end='\t')
+        print("本次输入为：",b[i])
+        break
+print("\n\n运算结果为：",Number.peek())'''
+if __name__ == '__main__':
+    s = input("输入表达式:" + "\n")
+    jisuan(s)

cities.json

@@ -0,0 +1,27 @@
+{
+    "1" : "北京",
+    "2" : "天津",
+    "3" : "郑州",
+    "4" : "呼和浩特",
+    "5" : "徐州",
+    "6" : "沈阳",
+    "7" : "武汉",
+    "8" : "西安",
+    "9" : "兰州",
+    "10" : "上海",
+    "11" : "大连",
+    "12" : "长春",
+    "13" : "株洲",
+    "14" : "成都",
+    "15" : "西宁",
+    "16" : "乌鲁木齐",
+    "17" : "哈尔滨",
+    "18" : "南昌",
+    "19" : "广州",
+    "20" : "贵阳",
+    "21" : "昆明",
+    "22" : "福州",
+    "23" : "深圳",
+    "24" : "柳州",
+    "25" : "南宁"
+}