style: comment

Author: 0x01f7

Diff for: algorithms/add_and_search_word_data_structure_design.rb

@@ -6,8 +6,7 @@
 #     bool search(word)
 #
 # search(word) can search a literal word or a regular expression string
-# containing only letters a-z or .. A . means it can represent any one
-# letter.
+# containing only letters a-z or .. A . means it can represent any one letter.
 #
 # For example:
 #

Diff for: algorithms/add_binary.rb

@@ -2,11 +2,7 @@
 #
 # Given two binary strings, return their sum (also a binary string).
 #
-# For example,
-#
-#     a = "11"
-#     b = "1"
-#     Return "100"
+# For example, a = "11", b = "1", Return "100".
 
 
 # @param {String} a

Diff for: algorithms/add_digits.rb

@@ -1,12 +1,21 @@
 # https://leetcode.com/problems/add-digits/
 #
-# Given a non-negative integer num, repeatedly add all its digits
-# until the result has only one digit.
+# Given a non-negative integer num, repeatedly add all its digits until the
+# result has only one digit.
 #
 # For example:
 #
 #     Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2.
 #     Since 2 has only one digit, return it.
+#
+# Follow up:
+#
+#     Could you do it without any loop/recursion in O(1) runtime?
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer} num

Diff for: algorithms/add_two_numbers.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/add-two-numbers/
 #
-# You are given two linked lists representing two non-negative numbers.
-# The digits are stored in reverse order and each of their nodes contain
-# a single digit. Add the two numbers and return it as a linked list.
+# You are given two linked lists representing two non-negative numbers. The
+# digits are stored in reverse order and each of their nodes contain a single
+# digit. Add the two numbers and return it as a linked list.
 #
 #  Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 # Output: 7 -> 0 -> 8

Diff for: algorithms/anagrams.rb

@@ -10,10 +10,10 @@
 #       ["bat"]
 #     ]
 #
-# Note:
+# Notes:
 #
-#     + For the return value, each inner list's elements must follow
-#       the lexicographic order.
+#     + For the return value, each inner list's elements must follow the
+#       lexicographic order.
 #     + All inputs will be in lower-case.