style: comment

Author: 0x01f7

algorithms/course_schedule.rb

@@ -2,7 +2,7 @@
 #
 # There are a total of n courses you have to take, labeled from 0 to n - 1.
 # Some courses may have prerequisites, for example to take course 0 you have
-# to first take course 1, which is expressed as a pair: [0,1]. Given the total
+# to first take course 1, which is expressed as a pair: [0, 1]. Given the total
 # number of courses and a list of prerequisite pairs, is it possible for you
 # to finish all courses?
 #

algorithms/course_schedule_ii.rb

@@ -2,7 +2,7 @@
 #
 # There are a total of n courses you have to take, labeled from 0 to n - 1.
 # Some courses may have prerequisites, for example to take course 0 you have
-# to first take course 1, which is expressed as a pair: [0,1]. Given the total
+# to first take course 1, which is expressed as a pair: [0, 1]. Given the total
 # number of courses and a list of prerequisite pairs, return the ordering of
 # courses you should take to finish all courses.
 #

algorithms/first_missing_positive.rb

@@ -4,7 +4,7 @@
 #
 # For example:
 #
-#     Given [1,2,0] return 3, and [3,4,-1,1] return 2.
+#     Given [1, 2, 0] return 3, and [3, 4, -1, 1] return 2.
 #
 # Your algorithm should run in O(n) time and uses constant space.
 

algorithms/gray_code.rb

@@ -5,7 +5,7 @@
 # number of bits in the code, print the sequence of gray code. A gray code
 # sequence must begin with 0.
 #
-# For example, given n = 2, return [0,1,3,2]. Its gray code sequence is:
+# For example, given n = 2, return [0, 1, 3, 2]. Its gray code sequence is:
 #
 #     00 - 0
 #     01 - 1
@@ -15,8 +15,8 @@
 # Note:
 #
 #     + For a given n, a gray code sequence is not uniquely defined.
-#     + For example, [0,2,3,1] is also a valid gray code sequence according to
-#       the above definition.
+#     + For example, [0, 2, 3, 1] is also a valid gray code sequence according
+#       to the above definition.
 #     + For now, the judge is able to judge based on one instance of gray code
 #       sequence. Sorry about that.
 

algorithms/jump_game.rb

@@ -7,8 +7,8 @@
 #
 # For example:
 #
-#     A = [2,3,1,1,4], return true.
-#     A = [3,2,1,0,4], return false.
+#     A = [2, 3, 1, 1, 4], return true.
+#     A = [3, 2, 1, 0, 4], return false.
 
 
 # @param {Integer[]} nums

algorithms/jump_game_ii.rb

@@ -7,7 +7,7 @@
 #
 # For example:
 #
-#     Given array A = [2,3,1,1,4]
+#     Given array A = [2, 3, 1, 1, 4]
 #     The minimum number of jumps to reach the last index is 2. (Jump 1 step
 #     from index 0 to 1, then 3 steps to the last index.)
 

algorithms/kth_largest_element_in_an_array.rb

@@ -3,7 +3,7 @@
 # Find the kth largest element in an unsorted array. Note that it is the kth
 # largest element in the sorted order, not the kth distinct element.
 #
-# For example, Given [3,2,1,5,6,4] and k = 2, return 5.
+# For example, Given [3, 2, 1, 5, 6, 4] and k = 2, return 5.
 #
 # Note:
 #

algorithms/largest_rectangle_in_histogram.rb

@@ -35,7 +35,7 @@
 #     |   |   |+-+|+-+|   |   |
 #     |___|___|+-+|+-+|___|___|
 #
-# For example, Given height = [2,1,5,6,2,3], return 10.
+# For example, Given height = [2, 1, 5, 6, 2, 3], return 10.
 
 
 # @param {Integer[]} height

algorithms/maximum_product_subarray.rb

@@ -3,7 +3,7 @@
 # Find the contiguous subarray within an array (containing at least one number)
 # which has the largest product.
 #
-# For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has
+# For example, given the array [2, 3, -2, 4], the contiguous subarray [2,3] has
 # the largest product = 6.
 
 

algorithms/minimum_size_subarray_sum.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/minimum-size-subarray-sum/
 #
 # Given an array of n positive integers and a positive integer s, find the
-# minimal length of a subarray of which the sum ≥ s. If there isn't one,
+# minimal length of a subarray of which the sum >= s. If there isn't one,
 # return 0 instead.
 #
 # For example, given the array [2, 3, 1, 2, 4, 3] and s = 7, the subarray

algorithms/next_permutation.rb

@@ -7,9 +7,9 @@
 # allocate extra memory. Here are some examples. Inputs are in the left-hand
 # column and its corresponding outputs are in the right-hand column.
 #
-#     1,2,3 -> 1,3,2
-#     3,2,1 -> 1,2,3
-#     1,1,5 -> 1,5,1
+#     1, 2, 3 -> 1, 3, 2
+#     3, 2, 1 -> 1, 2, 3
+#     1, 1, 5 -> 1, 5, 1
 
 
 # @param {Integer[]} nums

algorithms/partition_list.rb

@@ -8,8 +8,8 @@
 #
 # For example:
 #
-#     Given 1->4->3->2->5->2 and x = 3,
-#     Return 1->2->2->4->3->5.
+#     Given 1 -> 4 -> 3 -> 2 -> 5 -> 2 and x = 3,
+#     Return 1 -> 2 -> 2 -> 4 -> 3 -> 5.
 
 
 # Definition for singly-linked list.

algorithms/pascals_triangle_ii.rb

@@ -2,7 +2,7 @@
 #
 # Given an index k, return the kth row of the Pascal's triangle.
 #
-# For example, given k = 3, Return [1,3,3,1].
+# For example, given k = 3, Return [1, 3, 3, 1].
 #
 # Note:
 #

algorithms/path_sum.rb

@@ -15,8 +15,8 @@
 #          / \       \
 #         7   2       1
 #
-#     Return true, as there exist a root-to-leaf
-#     path 5->4->11->2 which sum is 22.
+#     Return true, as there exist a root-to-leaf path 5 -> 4 -> 11 -> 2 which
+#     sum is 22.
 
 
 # Definition for a binary tree node.

algorithms/permutation_sequence.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/permutation-sequence/
 #
-# The set [1,2,3,…,n] contains a total of n! unique permutations. By listing
-# and labeling all of the permutations in order, We get the following sequence
-# (ie, for n = 3):
+# The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By
+# listing and labeling all of the permutations in order, We get the following
+# sequence (ie, for n = 3):
 #
 #     1. "123"
 #     2. "132"