uniq_path.py

# def uniquePaths(int m, int n) :
#         int[][] paths = new int[m][n];
#         for (int i = 0; i < m; i ++){
#             paths[i][0] = 1;
#         }
#         for (int j = 0; j < n; j ++){
#             paths[0][j] = 1;
#         }
#         for (int i = 1; i < m ; i ++){
#             for (int j = 1; j < n; j ++){
#                 paths[i][j] = paths[i-1][j] + paths[i][j-1];
#             }
#         }
#         return paths[m-1][n-1];
#     }

# def main():
# 	inputs = [
# 		[[0,0,0], [0,1,0], [0,0,0]],
# 		[[1,0,0,0], [0,0,1,1], [1,0,0,1], [0,1,0,1]],
# 		[[0,1], [0,0]]
# 	]

# 	printedOutput = ""

# 	for i in range(len(inputs)):
# 		#printedOutput = str(i+1) + ". unique_paths_with_obstacles(\n" + print_grid(inputs[i]) + "\n) = "
# 		paths = unique_paths_with_obstacles(inputs[i])
# 		print(printedOutput + str(paths))
# 		print("------------------------------------------------------------------------------------------------------\n")

# if __name__ == '__main__':
#     main()