style: comment

Author: 0x01f7

algorithms/next_permutation.rb

@@ -1,12 +1,11 @@
 # https://leetcode.com/problems/next-permutation/
 #
 # Implement next permutation, which rearranges numbers into the
-# lexicographically next greater permutation of numbers. If
-# such arrangement is not possible, it must rearrange it as the
-# lowest possible order (ie, sorted in ascending order). The
-# replacement must be in-place, do not allocate extra memory.
-# Here are some examples. Inputs are in the left-hand column
-# and its corresponding outputs are in the right-hand column.
+# lexicographically next greater permutation of numbers. If such arrangement
+# is not possible, it must rearrange it as the lowest possible order (ie,
+# sorted in ascending order). The replacement must be in-place, do not
+# 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

algorithms/nim_game.rb

@@ -1,17 +1,22 @@
 # https://leetcode.com/problems/nim-game/
 #
-# You are playing the following Nim Game with your friend: There is a heap
-# of stones on the table, each time one of you take turns to remove 1 to 3
-# stones. The one who removes the last stone will be the winner. You will
-# take the first turn to remove the stones.
+# You are playing the following Nim Game with your friend: There is a heap of
+# stones on the table, each time one of you take turns to remove 1 to 3 stones.
+# The one who removes the last stone will be the winner. You will take the
+# first turn to remove the stones.
 #
-# Both of you are very clever and have optimal strategies for the game.
-# Write a function to determine whether you can win the game given the
-# number of stones in the heap.
+# Both of you are very clever and have optimal strategies for the game. Write
+# a function to determine whether you can win the game given the number of
+# stones in the heap.
 #
-# For example, if there are 4 stones in the heap, then you will never win
-# the game: no matter 1, 2, or 3 stones you remove, the last stone will
-# always be removed by your friend.
+# For example, if there are 4 stones in the heap, then you will never win the
+# game: no matter 1, 2, or 3 stones you remove, the last stone will always be
+# removed by your friend.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer} n

algorithms/number_of_1_bits.rb

@@ -1,12 +1,15 @@
 # https://leetcode.com/problems/number-of-1-bits/
 #
-# Write a function that takes an unsigned integer
-# and returns the number of ’1' bits it has (also
-# known as the Hamming weight).
+# Write a function that takes an unsigned integer and returns the number of '1'
+# bits it has (also known as the Hamming weight).
 #
-# For example, the 32-bit integer ’11' has binary
-# representation 00000000000000000000000000001011,
-# so the function should return 3.
+# For example, the 32-bit integer '11' has binary representation
+# 00000000000000000000000000001011, so the function should return 3.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # @param {Integer} n, a positive integer

algorithms/number_of_digit_one.rb

@@ -1,12 +1,12 @@
 # https://leetcode.com/problems/number-of-digit-one/
 #
-# Given an integer n, count the total number of digit 1 appearing
-# in all non-negative integers less than or equal to n.
+# Given an integer n, count the total number of digit 1 appearing in all
+# non-negative integers less than or equal to n.
 #
 # For example:
 #
-#     Given n = 13, Return 6, because digit 1 occurred in the
-#     following numbers: 1, 10, 11, 12, 13.
+#     Given n = 13, Return 6, because digit 1 occurred in the following
+#     numbers: 1, 10, 11, 12, 13.
 
 
 # @param {Integer} n

algorithms/number_of_islands.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/number-of-islands/
 #
-# Given a 2d grid map of '1's (land) and '0's (water), count the number
-# of islands. An island is surrounded by water and is formed by connecting
-# adjacent lands horizontally or vertically. You may assume all four edges
-# of the grid are all surrounded by water.
+# Given a 2d grid map of '1's (land) and '0's (water), count the number of
+# islands. An island is surrounded by water and is formed by connecting
+# adjacent lands horizontally or vertically. You may assume all four edges of
+# the grid are all surrounded by water.
 #
 # Example 1:
 #
@@ -22,6 +22,11 @@
 #     00011
 #
 #     Answer: 3
+#
+# Credits:
+#
+#     Special thanks to @mithmatt for adding this problem and creating all
+#     test cases.
 
 
 # @param {Character[][]} grid