Merge pull request apachecn#21 from cclauss/Python3

谢谢小哥哥 | print() is a function in Python 3

Author: jiangzhonglian

docs/Algorithm/Sort/BubbleSort.py

@@ -2,6 +2,7 @@
 
 
 # 冒泡排序
+from __future__ import print_function
 def bubble_sort(l):
     length = len(l)
     # 外层循环 length遍，内层循环少一遍
@@ -16,4 +17,4 @@ def bubble_sort(l):
 if __name__ == "__main__":
     l = [5, 1, 9, 3, 2, 7]
     bubble_sort(l)
-    print l
+    print(l)

docs/Algorithm/Sort/InsertSort.py

@@ -5,20 +5,21 @@
 插入排序的前提是：左边是有序的数列
 而冒泡排序：相邻的值进行交换，一共进行n次交换
 """
+from __future__ import print_function
 
 
 def insert_sort(l):
     # 循环  除第一个数字组成的有序数组 以外的数字
     for i in range(1, len(l)):
         # 每一个数字，依次和有序数组进行比较
-        print l[:i]
+        print(l[:i])
         for j in range(len(l[:i])):
             if l[i] < l[j]:
                 l[i], l[j] = l[j], l[i]
 
 
 if __name__ == "__main__":
     l = [5, 1, 9, 3, 2, 7]
-    print l
+    print(l)
     insert_sort(l)
     print("result: " + str(l))

docs/Algorithm/Sort/MergeSort.py

@@ -1,17 +1,18 @@
 # coding: utf-8
 
 
+from __future__ import print_function
 def MergeSort(lists):
     if len(lists) <= 1:
         return lists
     num = int(len(lists) / 2)
     # 从中间，进行数据的拆分, 递归的返回数据进行迭代排序
     left = MergeSort(lists[:num])
     right = MergeSort(lists[num:])
-    print left
-    print "*" * 20
-    print right
-    print "_" * 20
+    print(left)
+    print("*" * 20)
+    print(right)
+    print("_" * 20)
     return Merge(left, right)
 
 
@@ -27,9 +28,9 @@ def Merge(left, right):
             r += 1
     result += right[r:]
     result += left[l:]
-    print 'result:', result
+    print('result:', result)
     return result
 
 
 if __name__ == "__main__":
-    print MergeSort([1, 2, 3, 4, 5, 6, 7, 90, 21, 23, 45])
+    print(MergeSort([1, 2, 3, 4, 5, 6, 7, 90, 21, 23, 45]))

docs/Algorithm/Sort/QuickSort.py

@@ -2,6 +2,7 @@
 # coding:utf8
 
 
+from __future__ import print_function
 def quick_sort(l, start, end):
     i = start
     j = end
@@ -14,12 +15,12 @@ def quick_sort(l, start, end):
     while i < j:
         # 和最右边的比较，如果>=key,然后j-1，慢慢的和前一个值比较;如果值<key，那么就交换位置
         while i < j and key <= l[j]:
-            print key, l[j], '*' * 30
+            print(key, l[j], '*' * 30)
             j -= 1
         l[i] = l[j]
         # 交换位置后，然后在和最左边的值开始比较，如果<=key,然后i+1，慢慢的和后一个值比较;如果值>key，那么就交换位置
         while i < j and key >= l[i]:
-            print key, l[i], '*' * 30
+            print(key, l[i], '*' * 30)
             i += 1
         l[j] = l[i]
     l[i] = key
@@ -32,4 +33,4 @@ def quick_sort(l, start, end):
 if __name__ == "__main__":
     l = [5, 1, 9, 3, 2, 7]
     quick_sort(l, 0, len(l) - 1)
-    print l
+    print(l)

docs/Algorithm/Sort/SelectionSort.py

@@ -5,6 +5,7 @@
 选择排序的前提是：找到最大值的位置，最后才进行1次交换
 而冒泡排序：相邻的值进行交换，一共进行n次交换
 """
+from __future__ import print_function
 
 
 def selection_sort(l):
@@ -17,12 +18,12 @@ def selection_sort(l):
             if l[j] > l[index]:
                 index = j
         l[length], l[index] = l[index], l[length]
-        print len(l) - length, l
+        print(len(l) - length, l)
         length -= 1
 
 
 if __name__ == "__main__":
     l = [5, 1, 9, 3, 2, 7]
-    print l
+    print(l)
     selection_sort(l)
     print("result: " + str(l))

docs/Algorithm/Sort/ShellSort.py

@@ -1,11 +1,12 @@
 # coding: utf8
 
+from __future__ import print_function
 def insert_sort(l, start, increment):
     for i in range(start+increment, len(l), increment):
         for j in range(start, len(l[:i]), increment):
             if l[i] < l[j]:
                 l[i], l[j] = l[j], l[i]
-    print increment, '--',l
+    print(increment, '--',l)
     return l
 
 def shell_sort(l, increment):
@@ -20,6 +21,6 @@ def shell_sort(l, increment):
 if __name__ == "__main__":
     l = [5, 2, 9, 8, 1, 10, 3, 4, 7]
     increment = len(l)/3+1 if len(l)%3 else len(l)/3
-    print "开始", l
+    print("开始", l)
     l = shell_sort(l, increment)
-    print "结束", l
+    print("结束", l)

docs/Leetcode_Solutions/Summarization/Python刷题技巧笔记.py

@@ -1,3 +1,4 @@
+from __future__ import print_function
 # python有无数奇技淫巧和许多人不知道的秘密，这里用简洁的语言一条条表述出来，不断更新, 大家一起贡献！
 
 # 1. python 排序

src/py2.x/TreeRecursionIterator.py

@@ -1,5 +1,6 @@
 # coding:utf8
 
+from __future__ import print_function
 class Node():
     def __init__(self, value, left=None, right=None):
         self.value = value
@@ -10,7 +11,7 @@ def midRecusion(node):
     if node is None:
         return
     midRecusion(node.left)
-    print node.value,
+    print(node.value, end=' ')
     midRecusion(node.right)
 
 def midIterator(node):
@@ -21,7 +22,7 @@ def midIterator(node):
             node = node.left
         else:
             node = stack.pop(-1)
-            print node.value,
+            print(node.value, end=' ')
             node = node.right
 
 if __name__ == "__main__":

src/py2.x/list2iteration.py

@@ -4,6 +4,7 @@
 迭代使用的是循环结构。
 递归使用的是选择结构。
 '''
+from __future__ import print_function
 
 # 递归求解
 def calculate(l):

src/py3.x/TreeRecursionIterator.py

@@ -1,5 +1,6 @@
 # coding:utf8
 
+from __future__ import print_function
 class Node():
     def __init__(self, value, left=None, right=None):
         self.value = value
@@ -10,7 +11,7 @@ def midRecusion(node):
     if node is None:
         return
     midRecusion(node.left)
-    print node.value,
+    print(node.value, end=' ')
     midRecusion(node.right)
 
 def midIterator(node):
@@ -21,7 +22,7 @@ def midIterator(node):
             node = node.left
         else:
             node = stack.pop(-1)
-            print node.value,
+            print(node.value, end=' ')
             node = node.right
 
 if __name__ == "__main__":