style: comment

Author: 0x01f7

algorithms/game_of_life.rb

@@ -30,6 +30,11 @@
 #       principle, the board is infinite, which would cause problems when
 #       the active area encroaches the border of the array. How would you
 #       address these problems?
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[][]} board

algorithms/gas_station.rb

@@ -1,12 +1,12 @@
 # https://leetcode.com/problems/gas-station/
 #
-# There are N gas stations along a circular route, where the amount of gas
-# at station i is gas[i]. You have a car with an unlimited gas tank and it
-# costs cost[i] of gas to travel from station i to its next station (i+1).
-# You begin the journey with an empty tank at one of the gas stations.
+# There are N gas stations along a circular route, where the amount of gas at
+# station i is gas[i]. You have a car with an unlimited gas tank and it costs
+# cost[i] of gas to travel from station i to its next station (i+1). You begin
+# the journey with an empty tank at one of the gas stations.
 #
-# Return the starting gas station's index if you can travel around the
-# circuit once, otherwise return -1.
+# Return the starting gas station's index if you can travel around the circuit
+# once, otherwise return -1.
 #
 # Note: The solution is guaranteed to be unique.
 

algorithms/generate_parentheses.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/generate-parentheses/
 #
-# Given n pairs of parentheses, write a function to generate all
-# combinations of well-formed parentheses.
+# Given n pairs of parentheses, write a function to generate all combinations
+# of well-formed parentheses.
 #
 # For example, given n = 3, a solution set is:
 #

algorithms/gray_code.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/gray-code/
 #
-# The gray code is a binary numeral system where two successive values
-# differ in only one bit. Given a non-negative integer n representing
-# the total number of bits in the code, print the sequence of gray
-# code. A gray code sequence must begin with 0.
+# The gray code is a binary numeral system where two successive values differ
+# in only one bit. Given a non-negative integer n representing the total
+# 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:
 #
@@ -15,10 +15,10 @@
 # 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 now, the judge is able to judge based on one instance of
-#       gray code sequence. Sorry about that.
+#     + 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.
 
 
 # @param {Integer} n