Fix Ruby comments

Author: krahets

en/codes/ruby/chapter_array_and_linkedlist/array.rb

@@ -4,7 +4,7 @@
 Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
 =end
 
-# ### Random access element ###
+### Random access element ###
 def random_access(nums)
   # Randomly select a number in the interval [0, nums.length)
   random_index = Random.rand(0...nums.length)
@@ -14,7 +14,7 @@ def random_access(nums)
 end
 
 
-# ### Extend array length ###
+### Extend array length ###
 # Note: Ruby's Array is dynamic array, can be directly expanded
 # For learning purposes, this function treats Array as fixed-length array
 def extend(nums, enlarge)
@@ -30,7 +30,7 @@ def extend(nums, enlarge)
   res
 end
 
-# ### Insert element num at index in array ###
+### Insert element num at index in array ###
 def insert(nums, num, index)
   # Move all elements at and after index index backward by one position
   for i in (nums.length - 1).downto(index + 1)
@@ -42,15 +42,15 @@ def insert(nums, num, index)
 end
 
 
-# ### Delete element at index ###
+### Delete element at index ###
 def remove(nums, index)
   # Move all elements after index index forward by one position
   for i in index...(nums.length - 1)
     nums[i] = nums[i + 1]
   end
 end
 
-# ### Traverse array ###
+### Traverse array ###
 def traverse(nums)
   count = 0
 
@@ -65,7 +65,7 @@ def traverse(nums)
   end
 end
 
-# ### Find specified element in array ###
+### Find specified element in array ###
 def find(nums, target)
   for i in 0...nums.length
     return i if nums[i] == target

en/codes/ruby/chapter_array_and_linkedlist/linked_list.rb

@@ -7,15 +7,15 @@
 require_relative '../utils/list_node'
 require_relative '../utils/print_util'
 
-# ### Insert node _p after node n0 in linked list ###
+### Insert node _p after node n0 in linked list ###
 # Ruby's `p` is a built-in function, `P` is a constant, so use `_p` instead
 def insert(n0, _p)
   n1 = n0.next
   _p.next = n1
   n0.next = _p
 end
 
-# ### Delete first node after node n0 in linked list ###
+### Delete first node after node n0 in linked list ###
 def remove(n0)
   return if n0.next.nil?
 
@@ -25,7 +25,7 @@ def remove(n0)
   n0.next = n1
 end
 
-# ### Access node at index in linked list ###
+### Access node at index in linked list ###
 def access(head, index)
   for i in 0...index
     return nil if head.nil?
@@ -35,7 +35,7 @@ def access(head, index)
   head
 end
 
-# ### Find first node with value target in linked list ###
+### Find first node with value target in linked list ###
 def find(head, target)
   index = 0
   while head

en/codes/ruby/chapter_array_and_linkedlist/my_list.rb

@@ -4,33 +4,33 @@
 Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
 =end
 
-# ### List class ###
+### List class ###
 class MyList
   attr_reader :size       # Get list length (current number of elements)
   attr_reader :capacity   # Get list capacity
 
-  # ### Constructor ###
+  ### Constructor ###
   def initialize
     @capacity = 10
     @size = 0
     @extend_ratio = 2
     @arr = Array.new(capacity)
   end
 
-  # ### Access element ###
+  ### Access element ###
   def get(index)
     # If the index is out of bounds, throw an exception, as below
     raise IndexError, "Index out of bounds" if index < 0 || index >= size
     @arr[index]
   end
 
-  # ### Access element ###
+  ### Access element ###
   def set(index, num)
     raise IndexError, "Index out of bounds" if index < 0 || index >= size
     @arr[index] = num
   end
 
-  # ### Add element at end ###
+  ### Add element at end ###
   def add(num)
     # When the number of elements exceeds capacity, trigger the extension mechanism
     extend_capacity if size == capacity
@@ -40,7 +40,7 @@ def add(num)
     @size += 1
   end
 
-  # ### Insert element in middle ###
+  ### Insert element in middle ###
   def insert(index, num)
     raise IndexError, "Index out of bounds" if index < 0 || index >= size
 
@@ -57,7 +57,7 @@ def insert(index, num)
     @size += 1
   end
 
-  # ### Delete element ###
+  ### Delete element ###
   def remove(index)
     raise IndexError, "Index out of bounds" if index < 0 || index >= size
     num = @arr[index]
@@ -74,15 +74,15 @@ def remove(index)
     num
   end
 
-  # ### Expand list capacity ###
+  ### Expand list capacity ###
   def extend_capacity
     # Create new array with length extend_ratio times original, copy original array to new array
     arr = @arr.dup + Array.new(capacity * (@extend_ratio - 1))
     # Add elements at the end
     @capacity = arr.length
   end
 
-  # ### Convert list to array ###
+  ### Convert list to array ###
   def to_array
     sz = size
     # Elements enqueue

en/codes/ruby/chapter_backtracking/n_queens.rb

@@ -4,7 +4,7 @@
 Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
 =end
 
-# ### Backtracking: n queens ###
+### Backtracking: n queens ###
 def backtrack(row, n, state, res, cols, diags1, diags2)
   # When all rows are placed, record the solution
   if row == n
@@ -31,7 +31,7 @@ def backtrack(row, n, state, res, cols, diags1, diags2)
   end
 end
 
-# ### Solve n queens ###
+### Solve n queens ###
 def n_queens(n)
   # Initialize an n*n chessboard, where 'Q' represents a queen and '#' represents an empty cell
   state = Array.new(n) { Array.new(n, "#") }

en/codes/ruby/chapter_backtracking/permutations_i.rb

@@ -4,7 +4,7 @@
 Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
 =end
 
-# ### Backtracking: permutations I ###
+### Backtracking: permutations I ###
 def backtrack(state, choices, selected, res)
   # When the state length equals the number of elements, record the solution
   if state.length == choices.length
@@ -28,7 +28,7 @@ def backtrack(state, choices, selected, res)
   end
 end
 
-# ### Permutations I ###
+### Permutations I ###
 def permutations_i(nums)
   res = []
   backtrack([], nums, Array.new(nums.length, false), res)

en/codes/ruby/chapter_backtracking/permutations_ii.rb

@@ -4,7 +4,7 @@
 Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
 =end
 
-# ### Backtracking: permutations II ###
+### Backtracking: permutations II ###
 def backtrack(state, choices, selected, res)
   # When the state length equals the number of elements, record the solution
   if state.length == choices.length
@@ -30,7 +30,7 @@ def backtrack(state, choices, selected, res)
   end
 end
 
-# ### Permutations II ###
+### Permutations II ###
 def permutations_ii(nums)
   res = []
   backtrack([], nums, Array.new(nums.length, false), res)

en/codes/ruby/chapter_backtracking/preorder_traversal_i_compact.rb

@@ -7,7 +7,7 @@
 require_relative '../utils/tree_node'
 require_relative '../utils/print_util'
 
-# ### Pre-order traversal: example 1 ###
+### Pre-order traversal: example 1 ###
 def pre_order(root)
   return unless root
 

en/codes/ruby/chapter_backtracking/preorder_traversal_ii_compact.rb

@@ -7,7 +7,7 @@
 require_relative '../utils/tree_node'
 require_relative '../utils/print_util'
 
-# ### Pre-order traversal: example 2 ###
+### Pre-order traversal: example 2 ###
 def pre_order(root)
   return unless root
 

en/codes/ruby/chapter_backtracking/preorder_traversal_iii_compact.rb

@@ -7,7 +7,7 @@
 require_relative '../utils/tree_node'
 require_relative '../utils/print_util'
 
-# ### Pre-order traversal: example 3 ###
+### Pre-order traversal: example 3 ###
 def pre_order(root)
   # Pruning
   return if !root || root.val == 3

en/codes/ruby/chapter_backtracking/preorder_traversal_iii_template.rb

@@ -7,32 +7,32 @@
 require_relative '../utils/tree_node'
 require_relative '../utils/print_util'
 
-# ### Check if current state is solution ###
+### Check if current state is solution ###
 def is_solution?(state)
   !state.empty? && state.last.val == 7
 end
 
-# ### Record solution ###
+### Record solution ###
 def record_solution(state, res)
   res << state.dup
 end
 
-# ### Check if choice is valid in current state ###
+### Check if choice is valid in current state ###
 def is_valid?(state, choice)
   choice && choice.val != 3
 end
 
-# ### Update state ###
+### Update state ###
 def make_choice(state, choice)
   state << choice
 end
 
-# ### Restore state ###
+### Restore state ###
 def undo_choice(state, choice)
   state.pop
 end
 
-# ### Backtracking: example 3 ###
+### Backtracking: example 3 ###
 def backtrack(state, choices, res)
   # Check if it is a solution
   record_solution(state, res) if is_solution?(state)