* feat: Add javascript and typescript code in chapter_computational_complexity
* docs: Update code comment
* style: update code order th same with java
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
* fix(array.c): Fix unreleased memory error
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
* fix(linkedlist_queue.c): Fix linkedlist_queue.c print error
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* fix(codes/cpp/chapter_greedy): Fix print error.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* style: Remove unnecessary print.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
* fix(codes/c/chapter_heap): Fix my_head.c build error.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: Add C codes for chapter_hashing
* fix:Make corrections to the formatting
* fix:Fixing Test Cases
* fix:Fixing Test Cases
* fix:revised format
* Update hash_map_chaining.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: add Swift codes for greedy_algorithm article
* feat: add Swift codes for fractional_knapsack_problem article
* feat: add Swift codes for max_capacity_problem article
* feat: add Swift codes for max_product_cutting_problem article
* feat: add Swift codes for binary_search_recur article
* feat: add Swift codes for build_binary_tree_problem article
* feat: add Swift codes for hanota_problem article
* Fix binary_search_tree TS code
* Update binary_search_tree js code style
* Add the JavaScript code for Chapter of Greedy
* Add the TypeScript code for Chapter of Greedy
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(JS and TS):add the section of iteration and recursion
* feat(JS and TS):add the section of iteration and recursion
* feat(JS and TS):add the section of iteration and recursion
* fix: Correcting typos
* Add JavaScript and TypeScript code of dynamic programming.
* fix: Code Style
* Change ==/!= to ===/!==
* Create const by default, change to let if necessary.
* style fix: Delete unnecessary defined type
* Add binary_search_insertion and binary_search_edge code in javascript and typescript.
* code style fix: in FOR loop, use CONST will be nicer.
* fix: Code Style
* Change ==/!= to ===/!==
* Create const by default, change to let if necessary.
* Update import files
* Update codes/javascript/chapter_searching/binary_search_edge.js
Co-authored-by: Justin Tse <xiefahit@gmail.com>
* style fix: Delete unnecessary defined type
---------
Co-authored-by: Justin Tse <xiefahit@gmail.com>
* fix: fixed the bug of arrToTree function
* feat(tree): Add the array representation of the binary tree(js,ts)
* refactor: Make the arrToTree method match the method in java
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
* feat(codes/c): Add array_binary_tree.c
* feat(code/c): Update push_back and pop_back in vector.h
* styles(codes/c): Adjust format.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1
* style(chapter_dynamic_programming): format code
* refactor(chapter_dynamic_programming): remove main definition and add type
* feat(chapter_backtracking): Add js and ts codes for chapter 13.3
* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2
* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3
* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4
* style(chapter_divide_and_conquer): fix typo
* refactor: Use === instead of == in js and ts
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix space_complexity.c build error.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* feat(codes/c): Add part of the c code in the backtracking chapter
* feat(codes/c): Add preorder_traversal_iii_compact.c
* feat(codes/c): Add preorder_traversal_iii_template.c
* feat(codes/c): Add permutations_i.c
* style(codes/c): Adjust the format
* feat(codes/c): Add memory release in chapter_backtracking
* fix(codes/c): Fix memory release issue.
* style(codes/c): Update format and Merge duplicate code
* style(code/c): Change print format in preorder_traversal_iii_template.c
* Update preorder_traversal_iii_template.c
* Update permutations_i.c
* feat(codes/c): Remove myArray, use public vector.
* feat(codes/c): Add subset_sum_i_naive.c in C codes.
* feat(codes/c): Add permutations_i in CMakeLists.txt
* feat(codes/c): Update printf function in vector.h.
* feat(codes/c): Add subset_sum_i.c and subset_sum_ii.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1
* style(chapter_dynamic_programming): format code
* refactor(chapter_dynamic_programming): remove main definition and add type
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
* fix(codes/c): Fix quadraticRecur bug in `space_complexity.c`
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: Add Go code to binary search recursion under divide and conquer
* style: Code comment standardization
* style: modify function comment
* fix: fixed error when the list is empty
* Update print_utils.go
* Delete print_utils_test.go
* feat: add Go code to divide and conquer
* Update build_tree.go
* style: modify function name
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: Add Go code to binary search recursion under divide and conquer
* style: Code comment standardization
* style: modify function comment
* fix: fixed error when the list is empty
* Update print_utils.go
* Delete print_utils_test.go
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* Create chapter_graph
* Delete chapter_graph
* add C code for graph
* add C code for graph
* Create graph_adjacency_list.c
add C code for graph
* Update CMakeLists.txt
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update graph_adjacency_list.c
* Update CMakeLists.txt for c code of graph
* Update format of c code
* Update format of c code
* Update format of c code
* Update verticesList
Change the data structure of the storage list from a linked list to a linear table
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* Create graph_adjacency_list_test.c
* Create graph_bfs
* Update CMakeLists.txt
* Update graph_adjacency_list.c
* mv graph_bfs to graph_bfs.c
* Update graph_bfs.c
* Delete graph_bfs
* Update graph_adjacency_list.c
* update c code for graph operation.
* Update CMakeLists.txt
* Update graph_dfs.c
* Update graph_dfs.c
* Update CMakeLists.txt
* Update graph_dfs.c
* Update note of graph_dfs.c
* Update graph_bfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update output "初始化后，图为：" of graph_dfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update graph_dfs.c
* Update name of arrayVertex
* Update name of arrayVertex
* Update note of graph_dfs.c
* Update note of graph_bfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update graph_adjacency_matrix.c
* Update graph_adjacency_list_test.c
* Update graph_adjacency_list.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update comment
* Update comment
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* update comment
* update comment
* update comment for graph operation
* update comment of graph operation
* update comment
* update comment
---------
Co-authored-by: Yudong Jin <krahets@163.com>
Co-authored-by: libr <libr@info2soft.com>
* feat: add Swift codes for intro_to_dynamic_programming article
* feat: add Swift codes for dp_problem_features article
* feat: add Swift codes for dp_solution_pipeline article
* feat: add Swift codes for knapsack_problem article
* feat: add Swift codes for unbounded_knapsack_problem article
* feat: add Swift codes for edit_distance_problem article
* Add the chapter of divide and conquer.
Add the section of divide and conquer algorithm.
Add the section of build tree problem.
* Update build_tree.py
* feat: add rust codes for avl tree
* fix a wrong usage of borrow method of RefCell
* Update avl_tree.rs
* fix comment indentation and field define of TreeNode
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* Create chapter_graph
* Delete chapter_graph
* add C code for graph
* add C code for graph
* Create graph_adjacency_list.c
add C code for graph
* Update CMakeLists.txt
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update graph_adjacency_list.c
* Update CMakeLists.txt for c code of graph
* Update format of c code
* Update format of c code
* Update format of c code
* Update verticesList
Change the data structure of the storage list from a linked list to a linear table
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* Create graph_adjacency_list_test.c
* Create graph_bfs
* Update CMakeLists.txt
* Update graph_adjacency_list.c
* fix(csharp): fix csharp method name in knapsack
* feat(csharp): add csharp code for min path sum
* move INF define into method
* change INF to int max value
* fix(graph/adjacency_list):removeEdge not effects on graph in golang
* remove unecessary package right now
* Delete go.sum
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* The Rust version of the selection sort.
* The Rust version of the binary_search_edge
* update，The Rust version of the binary_search_edge and selection_sort
* update，The Rust version of the binary_search_edge and selection_sort
* update The Rust version of the binary_search_edge and selection_sort
* feat(go): support hash map chaining
* feat(go): support hash map open address
* feat(go): support simple hash
* feat(go): support top k heap
* feat(go): support subset sum I
* feat(go): support subset sum native
* feat(go): support subset sum II
* fix(go): fix some problem
* Fix the indentation of TS code
* Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge
* Fix the style of JS and TS code
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.
* fix(codes/cpp): Fix access error when printArray(arr, 0)
* Update PrintUtil.hpp
* fix(codes/c): Fix some errors of cmake build
* feat(codes/c): Add hashing_search.c
* styles(codes/c): Modify function description
* styles(codes/c): Modify binary_search.c code style
* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.
* feat: Add preorder_traversal_i_compact.c
* feat(codes/c): Add head_sort.c
* feat(codes/c): Add bucket_sort.c
* feat(codes/c): Add binary_search_edge.c
* fix(codes/c): Add programs that are not managed by cmake (c code)
* feat(codes/c): Add selection_sort.c
* style(codes/c): Change swap in selection_sort.c to `selectionSort`
* styles(codes/c): Change style.
* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(go/backtracking): add go code
* feat(backtracking): add n_queens in go
* feat(backtracking): add /preorder_traversal_i_compact in go
* feat(backtracking): add /preorder_traversal_ii_compact in go
* feat(backtracking): add /preorder_traversal_ii_template in go
* feat(backtracking): add preorder_traversal_iii_compact in go
* feat(backtracking): add preorder_traversal_test in go
* feat(backtracking): add permutations_i in go
* feat(backtracking): add permutations_ii in go
* feat(backtracking): add permutation_test in go
* feat(backtracking): fix bug in go
* Update permutations_i.go
---------
Co-authored-by: Yudong Jin <krahets@163.com>
王作勋
krahets
易春风
花无缺
Flamingo
liuyuxin
nuomi1
jmin
Reese Wellin
hpstory
Justin Tse
xianii
lyl625760
gonglja
xianii
malone6
MwumLi
keshida
linweibin
XiaChuerwu
gaofer
Reanon
William Yuan
yishangzhang
WangSL
Hongyun Zhang
NI-SW
ZongYangL
sjinzh
Jerry You
xBLACKICEx
Jefferson Huang
ZeYanLin
Justin Tse