Merge pull request keon#126 from yunshuipiao/master

fix factor_combinations and readme

README.md

@@ -23,7 +23,7 @@ Minimal and clean example implementations of data structures and algorithms in P
 - [backtrack](backtrack)
     - [general_solution.md](backtrack/)
     - [anagram](backtrack/anagram.py)
-    - [array_sum_combinations](backtrack/array_sum_combination.py)
+    - [array_sum_combinations](backtrack/array_sum_combinations.py)
     - [combination_sum](backtrack/combination_sum.py)
     - [expression_add_operators](backtrack/expression_add_operators.py)
     - [factor_combinations](backtrack/factor_combinations.py)

README_CN.md

@@ -23,7 +23,7 @@ python版数据结构和算法实现的简约版小示例
 - [backtrack：回溯](backtrack)
     - [general_solution.md：一般方法](backtrack/)
     - [anagram：同字母异序词](backtrack/anagram.py)
-    - [array_sum_combinations：数组和](backtrack/array_sum_combination.py)
+    - [array_sum_combinations：数组和](backtrack/array_sum_combinations.py)
     - [combination_sum：和的合并](backtrack/combination_sum.py)
     - [expression_add_operators：给表达式添加运算符](backtrack/expression_add_operators.py)
     - [factor_combinations：因素组合](backtrack/factor_combinations.py)
@@ -211,4 +211,5 @@ python版数据结构和算法实现的简约版小示例
         - [trie：字典](tree/trie/trie.py)
 - [union-find：并查集](union-find)
     - [count_islands：岛计数](union-find/count_islands.py)
+- [或者可以用不同语言来完成上述算法，期待加入](https://github.com/yunshuipiao/sw-algorithms)
 

backtrack/factor_combinations.py

@@ -42,8 +42,8 @@ def getFactors(self, n):
         n, i, combi = todo.pop()
         while i * i <= n:
             if n % i == 0:
-                combis += combi + [i, n/i],
-                todo += (n/i, i, combi+[i]),
+                combis.append(combi + [i, n/i]),
+                todo.append( [n / i, i, combi+[i] ] )  # python3: n // i
             i += 1
     return combis
 
@@ -53,7 +53,7 @@ def getFactors(self, n):
     def factor(n, i, combi, combis):
         while i * i <= n:
             if n % i == 0:
-                combis += combi + [i, n/i],
+                combis.append(combi + [i, n/i]),
                 factor(n/i, i, combi+[i], combis)
             i += 1
         return combis