adjust the comment length

Author: haoel

src/3Sum/3Sum.cpp

@@ -4,7 +4,8 @@
 
 /********************************************************************************** 
 * 
-* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
+* Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? 
+* Find all unique triplets in the array which gives the sum of zero.
 * 
 * Note:
 * 

src/3SumClosest/3SumClosest.cpp

@@ -4,7 +4,9 @@
 
 /********************************************************************************** 
 * 
-* Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
+* Given an array S of n integers, find three integers in S such that the sum is 
+* closest to a given number, target. Return the sum of the three integers. 
+* You may assume that each input would have exactly one solution.
 * 
 *     For example, given array S = {-1 2 1 -4}, and target = 1.
 * 

src/4Sum/4Sum.cpp

@@ -4,7 +4,8 @@
 
 /********************************************************************************** 
 * 
-* Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
+* Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? 
+* Find all unique quadruplets in the array which gives the sum of target.
 * 
 * Note:
 * 

src/LRUCache/LRUCache.cpp

@@ -4,11 +4,15 @@
 
 /********************************************************************************** 
 * 
-* Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.
-* 
-* get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
-* set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
+* Design and implement a data structure for Least Recently Used (LRU) cache. 
+* It should support the following operations: get and set.
 * 
+*    get(key) - Get the value (will always be positive) of the key if the key exists 
+*               in the cache, otherwise return -1.
+*
+*    set(key, value) - Set or insert the value if the key is not already present. 
+*                      When the cache reached its capacity, it should invalidate 
+*                      the least recently used item before inserting a new item.
 *               
 **********************************************************************************/
 

src/addTwoNumbers/addTwoNumbers.cpp

@@ -4,7 +4,9 @@
 
 /********************************************************************************** 
 * 
-* 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

src/balancedBinaryTree/balancedBinaryTree.cpp

@@ -6,7 +6,8 @@
 * 
 * Given a binary tree, determine if it is height-balanced.
 * 
-* For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
+* For this problem, a height-balanced binary tree is defined as a binary tree in which 
+* the depth of the two subtrees of every node never differ by more than 1.
 * 
 *               
 **********************************************************************************/

src/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.II.cpp

@@ -6,7 +6,10 @@
 * 
 * Say you have an array for which the ith element is the price of a given stock on day i.
 * 
-* Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
+* Design an algorithm to find the maximum profit. You may complete as many transactions 
+* as you like (ie, buy one and sell one share of the stock multiple times). However, 
+* you may not engage in multiple transactions at the same time (ie, you must sell the 
+* stock before you buy again).
 *               
 **********************************************************************************/
 

src/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.cpp

@@ -6,7 +6,8 @@
 * 
 * Say you have an array for which the ith element is the price of a given stock on day i.
 * 
-* If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
+* If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), 
+* design an algorithm to find the maximum profit.
 *               
 **********************************************************************************/
 

src/binaryTreeInorderTraversal/binaryTreeInorderTraversal.cpp

@@ -23,7 +23,8 @@
 * 
 * OJ's Binary Tree Serialization:
 * 
-* The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
+* The serialization of a binary tree follows a level order traversal, where '#' signifies 
+* a path terminator where no node exists below.
 * 
 * Here's an example:
 * 

src/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.II.cpp

@@ -4,7 +4,8 @@
 
 /********************************************************************************** 
 * 
-* Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
+* Given a binary tree, return the bottom-up level order traversal of its nodes' values. 
+* (ie, from left to right, level by level from leaf to root).
 * 
 * For example:
 * Given binary tree {3,9,20,#,#,15,7},
@@ -27,7 +28,8 @@
 * 
 * OJ's Binary Tree Serialization:
 * 
-* The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
+* The serialization of a binary tree follows a level order traversal, where '#' signifies 
+* a path terminator where no node exists below.
 * 
 * Here's an example:
 *