style: comment

Author: 0x01f7

algorithms/h_index.rb

@@ -1,20 +1,26 @@
 # https://leetcode.com/problems/h-index/
 #
-# Given an array of citations (each citation is a non-negative
-# integer) of a researcher, write a function to compute the
-# researcher's h-index. According to the definition of h-index
-# on Wikipedia: "A scientist has index h if h of his/her N papers
-# have at least h citations each, and the other N − h papers have
-# no more than h citations each."
+# Given an array of citations (each citation is a non-negative integer) of a
+# researcher, write a function to compute the researcher's h-index. According
+# to the definition of h-index on Wikipedia: "A scientist has index h if h of
+# his/her N papers have at least h citations each, and the other N − h papers
+# have no more than h citations each."
 #
-# For example, given citations = [3, 0, 6, 1, 5], which means the
-# researcher has 5 papers in total and each of them had received
-# 3, 0, 6, 1, 5 citations respectively. Since the researcher has
-# 3 papers with at least 3 citations each and the remaining two
-# with no more than 3 citations each, his h-index is 3.
+# For example, given citations = [3, 0, 6, 1, 5], which means the researcher
+# has 5 papers in total and each of them had received 3, 0, 6, 1, 5 citations
+# respectively. Since the researcher has 3 papers with at least 3 citations
+# each and the remaining two with no more than 3 citations each, his h-index
+# is 3.
 #
-# Note: If there are several possible values for h, the maximum
-# one is taken as the h-index.
+# Note:
+#
+#     If there are several possible values for h, the maximum one is taken as
+#     the h-index.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[]} citations

algorithms/happy_number.rb

@@ -1,18 +1,23 @@
 # https://leetcode.com/problems/happy-number/
 #
-# Write an algorithm to determine if a number is "happy". A happy number
-# is a number defined by the following process: Starting with any
-# positive integer, replace the number by the sum of the squares of its
-# digits, and repeat the process until the number equals 1 (where it
-# will stay), or it loops endlessly in a cycle which does not include 1.
-# Those numbers for which this process ends in 1 are happy numbers.
+# Write an algorithm to determine if a number is "happy". A happy number is a
+# number defined by the following process: Starting with any positive integer,
+# replace the number by the sum of the squares of its digits, and repeat the
+# process until the number equals 1 (where it will stay), or it loops
+# endlessly in a cycle which does not include 1. Those numbers for which this
+# process ends in 1 are happy numbers.
 #
 # Example: 19 is a happy number
 #
 #     1^2 + 9^2 = 82
 #     8^2 + 2^2 = 68
 #     6^2 + 8^2 = 100
 #     1^2 + 0^2 + 0^2 = 1
+#
+# Credits:
+#
+#     Special thanks to @mithmatt and @ts for adding this problem and creating
+#     all test cases.
 
 
 # @param {Integer} n

algorithms/house_robber.rb

@@ -2,13 +2,18 @@
 #
 # You are a professional robber planning to rob houses along a street. Each
 # house has a certain amount of money stashed, the only constraint stopping
-# you from robbing each of them is that adjacent houses have security
-# system connected and it will automatically contact the police if
-# two adjacent houses were broken into on the same night.
+# you from robbing each of them is that adjacent houses have security system
+# connected and it will automatically contact the police if two adjacent
+# houses were broken into on the same night.
 #
-# Given a list of non-negative integers representing the amount of money
-# of each house, determine the maximum amount of money you can rob
-# tonight without alerting the police.
+# Given a list of non-negative integers representing the amount of money of
+# each house, determine the maximum amount of money you can rob tonight
+# without alerting the police.
+#
+# Credits:
+#
+#     Special thanks to @ifanchu for adding this problem and creating all
+#     test cases. Also thanks to @ts for adding additional test cases.
 
 
 # @param {Integer[]} nums

algorithms/house_robber_ii.rb

@@ -2,15 +2,20 @@
 #
 # This is an extension of "House Robber".
 #
-# After robbing those houses on that street, the thief has found himself
-# a new place for his thievery so that he will not get too much attention.
-# This time, all houses at this place are arranged in a circle. That means
-# the first house is the neighbor of the last one. Meanwhile, the security
-# system for these houses remain the same as for those in the previous street.
+# After robbing those houses on that street, the thief has found himself a new
+# place for his thievery so that he will not get too much attention. This time,
+# all houses at this place are arranged in a circle. That means the first
+# house is the neighbor of the last one. Meanwhile, the security system for
+# these houses remain the same as for those in the previous street.
 #
-# Given a list of non-negative integers representing the amount of money
-# of each house, determine the maximum amount of money you can rob tonight
+# Given a list of non-negative integers representing the amount of money of
+# each house, determine the maximum amount of money you can rob tonight
 # without alerting the police.
+#
+# Credits:
+#
+#     Special thanks to @Freezen for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer[]} nums