init & reformat code

Author: xf4fresh

.gitignore

@@ -0,0 +1 @@
+.idea/

2d_list.py

@@ -1,5 +1,5 @@
 #! /usr/bin/env python
-#coding:utf-8
+# coding:utf-8
 
 """
 问题
@@ -13,34 +13,35 @@
 import random
 
 
-def score(score_list,course_list,student_num):
+def score(score_list, course_list, student_num):
     course_num = len(course_list)
-    
+
     every_score = [[score_list[j][i] for j in range(course_num)] for i in range(student_num)]
-    
+
     every_total = [sum(every_score[i]) for i in range(student_num)]
-    
-    ave_course = [sum(score_list[i])/len(score_list[i]) for i in range(len(score_list))]
-    
-    return (every_score,every_total,ave_course)
-
-if __name__=="__main__":
-    
-    course_list = ["C++","Java","Servlet","JSP","EJB"]
+
+    ave_course = [sum(score_list[i]) / len(score_list[i]) for i in range(len(score_list))]
+
+    return (every_score, every_total, ave_course)
+
+
+if __name__ == "__main__":
+
+    course_list = ["C++", "Java", "Servlet", "JSP", "EJB"]
     student_num = 20
-    
-    score_list = [[random.randint(0,100) for i in range(student_num)] for j in range(len(course_list))]
+
+    score_list = [[random.randint(0, 100) for i in range(student_num)] for j in range(len(course_list))]
     for i in range(len(course_list)):
-        print "score of every one in %s:"%course_list[i]
+        print "score of every one in %s:" % course_list[i]
         print score_list[i]
 
-    every_score,every_total,ave_one_course = score(score_list,course_list,student_num)
+    every_score, every_total, ave_one_course = score(score_list, course_list, student_num)
     print "\n"
     print "NEXT IS EVERY ONE SCORE IN EVERY COURSE:"
     for name in course_list:
         print name,
     print "\t"
     print every_score
     print "\n"
-    print "every one all score:\t",every_total
-    print "every course of average score:\t",ave_one_course
+    print "every one all score:\t", every_total
+    print "every course of average score:\t", ave_one_course

ahead_one_step.py

@@ -1,5 +1,5 @@
 #!/usr/bin/env python
-#coding:utf-8
+# coding:utf-8
 
 """
 问题：
@@ -9,11 +9,13 @@
 即，a[0]=a[1],a[1]=a[2],…最后一个元素的值是原来第一个元素的值，然后输出这个数组。
 """
 
+
 def ahead_one():
     a = [i for i in range(1, 11)]
     b = a.pop(0)
     a.append(b)
     return a
 
-if __name__ =="__main__":
+
+if __name__ == "__main__":
     print ahead_one()

average_score.py

@@ -1,5 +1,5 @@
 #! /usr/bin python
-#coding:utf-8
+# coding:utf-8
 
 """
 问题：
@@ -8,23 +8,26 @@
 (2)将这40个成绩按照从高到低的顺序输出出来。
 """
 
-#no need to import division from future just change num to float(num) 
+# no need to import division from future just change num to float(num)
 import random
 
+
 def make_score(num):
-    score = [random.randint(0,100) for i in range(num)]
+    score = [random.randint(0, 100) for i in range(num)]
     return score
 
+
 def less_average(score):
     num = len(score)
     sum_score = sum(score)
-    ave_num = sum_score/float(num)
-    less_ave = [i for i in score if i<ave_num]
-    return (ave_num,len(less_ave))
+    ave_num = sum_score / float(num)
+    less_ave = [i for i in score if i < ave_num]
+    return (ave_num, len(less_ave))
+
 
-if __name__=="__main__":
+if __name__ == "__main__":
     score = make_score(40)
-    average_num,less_num = less_average(score)
-    print 'the score of average is:',average_num
-    print "the number of less average is:",less_num
-    print "the every score is[from big to small]:",sorted(score,reverse=True)
+    average_num, less_num = less_average(score)
+    print 'the score of average is:', average_num
+    print "the number of less average is:", less_num
+    print "the every score is[from big to small]:", sorted(score, reverse=True)

big_int.py

@@ -1,5 +1,5 @@
 #!/usr/bin/env python
-#coding:utf-8
+# coding:utf-8
 
 """
 对于大整数计算，一般都要用某种方法转化，否则会溢出。但是python无此担忧了。
@@ -18,108 +18,110 @@
 
 """
 
-def arabic_multiplication(num1,num2):
-    num_lst1 = [int(i) for i in str(num1)]  #将int类型的123，转化为list类型的[1,2,3]，每个元素都是int类型
+
+def arabic_multiplication(num1, num2):
+    num_lst1 = [int(i) for i in str(num1)]  # 将int类型的123，转化为list类型的[1,2,3]，每个元素都是int类型
     num_lst2 = [int(i) for i in str(num2)]
 
-    #两个list中整数两两相乘
-    int_martix = [[i*j for i in num_lst1] for j in num_lst2]
-    
-    #将上述元素为数字的list转化为元素类型是str，主要是将9-->'09'
-    str_martix = [map(convert_to_str,int_martix[i]) for i in range(len(int_martix))]
-    
-    #将上述各个list中的两位数字分开：['01','29','03']-->[0,2,0],[1,9,3]
-    martix = [[int(str_martix[i][j][z]) for j in range(len(str_martix[i]))] for i in range(len(str_martix)) for z in range(2)]
-    
-    #计算阿拉伯乘法表的左侧开始各项和
+    # 两个list中整数两两相乘
+    int_martix = [[i * j for i in num_lst1] for j in num_lst2]
+
+    # 将上述元素为数字的list转化为元素类型是str，主要是将9-->'09'
+    str_martix = [map(convert_to_str, int_martix[i]) for i in range(len(int_martix))]
+
+    # 将上述各个list中的两位数字分开：['01','29','03']-->[0,2,0],[1,9,3]
+    martix = [[int(str_martix[i][j][z]) for j in range(len(str_martix[i]))] for i in range(len(str_martix)) for z in
+              range(2)]
+
+    # 计算阿拉伯乘法表的左侧开始各项和
     sum_left = summ_left(martix)
 
-    #计算阿拉伯乘法表的底部开始各项和
+    # 计算阿拉伯乘法表的底部开始各项和
     sum_end = summ_end(martix)
 
-    #将上述两个结果合并后翻转
+    # 将上述两个结果合并后翻转
     sum_left.extend(sum_end)
     sum_left.reverse()
 
-    #取得各个和的个位的数字（如果进位则加上）
+    # 取得各个和的个位的数字（如果进位则加上）
     result = take_digit(sum_left)
-    
-    #翻转结果并合并为一个结果字符串数值
+
+    # 翻转结果并合并为一个结果字符串数值
     result.reverse()
     int_result = "".join(result)
-    print "%d*%d="%(num1,num2)
+    print "%d*%d=" % (num1, num2)
     print int_result
 
 
-#将int类型转化为str类型，9-->'09'
+# 将int类型转化为str类型，9-->'09'
 
 def convert_to_str(num):
-    if num<10:
-        return "0"+str(num)
+    if num < 10:
+        return "0" + str(num)
     else:
         return str(num)
 
 
-#计算阿拉伯乘法表格左侧开始的各项之和
+# 计算阿拉伯乘法表格左侧开始的各项之和
 
 def summ_left(lst):
     summ = []
     x = [i for i in range(len(lst))]
     y = [j for j in range(len(lst[0]))]
-    sx = [i for i in x if i%2==0]
+    sx = [i for i in x if i % 2 == 0]
     for i in sx:
-        s=0
-        j=0
-        while i>=0 and j<=y[-1]:
-            s = s+ lst[i][j]
-            if i%2==1:
-                j = j+1
+        s = 0
+        j = 0
+        while i >= 0 and j <= y[-1]:
+            s = s + lst[i][j]
+            if i % 2 == 1:
+                j = j + 1
             else:
                 j = j
-            i = i-1
+            i = i - 1
         summ.append(s)
     return summ
 
 
-
-#计算阿拉伯乘法表格底部开始的各项之和
+# 计算阿拉伯乘法表格底部开始的各项之和
 
 def summ_end(lst):
-    summ=[]
+    summ = []
     y = [j for j in range(len(lst[0]))]
-    ex = len(lst)-1
+    ex = len(lst) - 1
     for m in range(len(y)):
         s = 0
-        i=ex
-        j=m
-        while i>=0 and j<=y[-1]:
-            s= s+lst[i][j]
-            if i%2==1:
-                j = j+1
+        i = ex
+        j = m
+        while i >= 0 and j <= y[-1]:
+            s = s + lst[i][j]
+            if i % 2 == 1:
+                j = j + 1
             else:
-                j=j
-            i = i-1
+                j = j
+            i = i - 1
         summ.append(s)
-    
+
     return summ
 
-#得到各个元素的个位数，如果是大于10则向下一个进位
+
+# 得到各个元素的个位数，如果是大于10则向下一个进位
 
 def take_digit(lst):
     tmp = 0
     digit_list = []
     for m in range(len(lst)):
         lstm = 0
-        lstm = lst[m]+tmp
-        if lstm<10:
+        lstm = lst[m] + tmp
+        if lstm < 10:
             tmp = 0
             digit_list.append(str(lstm))
         else:
-            tmp = lstm/10
-            mm = lstm-tmp*10
+            tmp = lstm / 10
+            mm = lstm - tmp * 10
             digit_list.append(str(mm))
     return digit_list
 
 
-if __name__=="__main__":
-    arabic_multiplication(469,37)
+if __name__ == "__main__":
+    arabic_multiplication(469, 37)

bin_search.py

@@ -1,5 +1,5 @@
 #!/usr/bin/evn python
-#coding:utf-8
+# coding:utf-8
 """
 #问题
 
@@ -32,21 +32,23 @@
 这种搜索算法每一次比较都使搜索范围缩小一半。时间复杂度：O(logn)
 """
 
-def binarySearch(lst, value,low,high):          #low,high是lst的查找范围
+
+def binarySearch(lst, value, low, high):  # low,high是lst的查找范围
     if high < low:
         return -1
-    mid = (low + high)/2
+    mid = (low + high) / 2
     if lst[mid] > value:
-        return binarySearch(lst, value, low, mid-1)
+        return binarySearch(lst, value, low, mid - 1)
     elif lst[mid] < value:
-        return binarySearch(lst, value, mid+1, high)
+        return binarySearch(lst, value, mid + 1, high)
     else:
         return mid
 
-#也可以不用递归方法，而采用循环，如下：
- 
+
+# 也可以不用递归方法，而采用循环，如下：
+
 def bsearch(l, value):
-    lo, hi = 0, len(l)-1
+    lo, hi = 0, len(l) - 1
     while lo <= hi:
         mid = (lo + hi) / 2
         if l[mid] < value:
@@ -56,7 +58,8 @@ def bsearch(l, value):
         else:
             return mid
     return -1
- 
+
+
 """
 对于python，不能忽视其强大的标准库。经查阅，发现标准库中就有一个模块，名为：bisect。其文档中有这样一句话：
 
@@ -76,16 +79,18 @@ def bsearch(l, value):
 
 -关于本模块，可以查看官方文档：https://docs.python.org/2/library/bisect.html
 """
-#下面演示这个模块
+# 下面演示这个模块
 
 from bisect import *
 
-def bisectSearch(lst, x):        
-    i = bisect_left(lst, x)         #bisect_left(lst,x)得到x在已经排序的lst中的位置
+
+def bisectSearch(lst, x):
+    i = bisect_left(lst, x)  # bisect_left(lst,x)得到x在已经排序的lst中的位置
     if i != len(lst) and lst[i] == x:
         return i
 
-if __name__=="__main__":
-    lst = sorted([2,5,3,8])
-    print bisectSearch(lst,5)
-    print bsearch(lst,5)
+
+if __name__ == "__main__":
+    lst = sorted([2, 5, 3, 8])
+    print bisectSearch(lst, 5)
+    print bsearch(lst, 5)