Modify Comments

Author: Turingfly

src/chapter01ArraysAndStrings/CheckPermutation.java

@@ -2,19 +2,20 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 11:48:50 AM
- * 
- *         Problem: Given two strings, write a method to decide if one is a
- *         permutation of other.
+ * Problem: Given two strings, write a method to decide if one is a permutation
+ * of other.
  *
- *         Solution: clarify case sensitive and whitespace
+ * Solution: clarify case sensitive and whitespace
  *
  */
 public class CheckPermutation {
-	// method1: sort then compare.
+	/**
+	 * method1: sort then compare.
+	 */
 
-	// method2: Check if two strings have identical character counts
+	/**
+	 * method2: Check if two strings have identical character counts
+	 */
 	public boolean perm(String s1, String s2) {
 		if (s1 == null || s2 == null || s1.length() != s2.length()) {
 			return false;

src/chapter01ArraysAndStrings/IsUnique.java

@@ -2,19 +2,13 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 11:29:15 AM
- * 
- *         Problem: Implement an algorithm to determine if a string has all
- *         unique characters. No extra data structure.
- *
- *         Solution:
+ * Problem: Implement an algorithm to determine if a string has all unique
+ * characters. No extra data structure.
  *
  */
 
 public class IsUnique {
 	/**
-	 * 
 	 * O(N) O(1)
 	 */
 	public boolean isUnique1(String s) {
@@ -33,8 +27,8 @@ public boolean isUnique1(String s) {
 	}
 
 	/**
-	 * Assume the string only uses lowercase letters. Use just a single int(32bits) 
-	 * to save more space complexity
+	 * Assume the string only uses lowercase letters. Use just a single
+	 * int(32bits) to save more space complexity
 	 */
 	public boolean isUnique2(String s) {
 		if (s == null || s.length() > 26) {

src/chapter01ArraysAndStrings/OneAway.java

@@ -2,20 +2,19 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 4:11:42 PM
+ * Problem: One Away: There are three types of edits that can be performed on
+ * strings: insert a character, remove a character, or replace a character.
+ * Given two strings, write a function to check if they are one edit (or zero
+ * edits) away.
  * 
- *         Problem: One Away: There are three types of edits that can be
- *         performed on strings: insert a character, remove a character, or
- *         replace a character. Given two strings, write a function to check if
- *         they are one edit (or zero edits) away. 
- *         
- *         Solution:
+ * Solution:
  *
  */
 public class OneAway {
-	// method1: replace, insert, delete.
-	// It is clearer and easier to follow but has some duplicate code.
+	/**
+	 * method1: replace, insert, delete.It is clearer and easier to follow but
+	 * has some duplicate code.
+	 */
 	public boolean oneEditAway(String s1, String s2) {
 		if (s1 == null || s2 == null) {
 			return false;
@@ -64,7 +63,9 @@ private boolean insert(String s1, String s2) {
 		return true;
 	}
 
-	// method2: Handle replace and insert in the same method;
+	/**
+	 *  method2: Handle replace and insert in the same method;
+	 */
 	public boolean method2(String s1, String s2) {
 		if (s1 == null || s2 == null || s1.length() - s2.length() == 0) {
 			return false;

src/chapter01ArraysAndStrings/PalindromePermutation.java

@@ -2,19 +2,13 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 3:46:14 PM
+ * Problem: Palindrome Permutation: Given a string, write a function to check if
+ * it is a permutation of a palindrome. A palindrome is a word or phrase that is
+ * the same forwards and backwards. A permutation is a rearrangement of letters.
+ * The palindrome does not need to be limited to just dictionary words.
  * 
- *         Problem: Palindrome Permutation: Given a string, write a function to
- *         check if it is a permutation of a palindrome. A palindrome is a word
- *         or phrase that is the same forwards and backwards. A permutation is a
- *         rearrangement of letters. The palindrome does not need to be limited
- *         to just dictionary words.
- * 
- *         EXAMPLE Input: tact coa 
- *         Output: True (permutations: "taco cat'; "atco eta·; etc.)
- *
- *         Solution:
+ * EXAMPLE Input: tact coa Output: True (permutations: "taco cat'; "atco eta·;
+ * etc.)
  *
  */
 public class PalindromePermutation {

src/chapter01ArraysAndStrings/RotateMatrix.java

@@ -1,15 +1,9 @@
 package chapter01ArraysAndStrings;
 
 /**
- * 
- * @author chengfeili 
- * Jun 15, 2017 6:23:31 PM
- * 
- *         Problem: Rotate Matrix: Given an image represented by an NxN matrix,
- *         where each pixel in the image is 4 bytes, write a method to rotate
- *         the image by 90 degrees. Can you do this in place?
- *
- *         Solution:
+ * Problem: Rotate Matrix: Given an image represented by an NxN matrix, where
+ * each pixel in the image is 4 bytes, write a method to rotate the image by 90
+ * degrees. Can you do this in place?
  *
  */
 public class RotateMatrix {

src/chapter01ArraysAndStrings/StringCompression.java

@@ -2,18 +2,13 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 4:56:35 PM
+ * Problem: Implement a method to perform basic string compression using the
+ * counts of repeated characters.
  * 
- *         Problem: Implement a method to perform basic string compression using
- *         the counts of repeated characters.
- * 
- *         For example, the string aabcccccaaa would become a2blc5a3. If the
- *         "compressed" string would not become smaller than the original
- *         string, your method should return the original string. You can assume
- *         the string has only uppercase and lowercase letters (a - z)
- *
- *         Solution:
+ * For example, the string aabcccccaaa would become a2blc5a3. If the
+ * "compressed" string would not become smaller than the original string, your
+ * method should return the original string. You can assume the string has only
+ * uppercase and lowercase letters (a - z)
  *
  */
 public class StringCompression {
@@ -22,7 +17,7 @@ public String compressBad(String str) {
 		int countConsecutive = 0;
 		for (int i = 0; i < str.length(); i++) {
 			countConsecutive++;
-			/*
+			/**
 			 * If next character is different than current, append this char to
 			 * result.
 			 */

src/chapter01ArraysAndStrings/StringRotation.java

@@ -2,14 +2,9 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 6:58:12 PM
- * 
- *         Problem: Assume you have a method isSubstring which checks if one
- *         word is a substring of another. Given two Strings, check if s2 is a
- *         rotation of s1 using only one call to isSubstring
- *
- *         Solution:
+ * Problem: Assume you have a method isSubstring which checks if one word is a
+ * substring of another. Given two Strings, check if s2 is a rotation of s1
+ * using only one call to isSubstring
  *
  */
 public class StringRotation {

src/chapter01ArraysAndStrings/Urlify.java

@@ -2,19 +2,14 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 12:00:35 PM
+ * Problem: Write a method to replace all spaces in a string with '%20 You may
+ * assume that the string has sufficient space at the end to hold the additional
+ * characters, and that you are given the "true" length of the string. (Note: if
+ * implementing in Java, please use a character array so that you can perform
+ * this operation in place.) EXAMPLE Input: "Mr John Smith     ", 13 Output:
+ * "Mr%20John%20Smith"
  * 
- *         Problem: Write a method to replace all spaces in a string
- *         with '%20 You may assume that the string has sufficient space at the
- *         end to hold the additional characters, and that you are given the
- *         "true" length of the string. (Note: if implementing in Java, please
- *         use a character array so that you can perform this operation in
- *         place.) 
- *         EXAMPLE Input: "Mr John Smith     ", 13 
- *         Output: "Mr%20John%20Smith"
- * 
- *         Solution: Start from the end and work backwards
+ * Solution: Start from the end and work backwards
  *
  */
 public class Urlify {

src/chapter01ArraysAndStrings/ZeroMatrix.java

@@ -2,26 +2,20 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 15, 2017 6:35:39 PM
- * 
- *         Problem: Write an algorithm such that if an element in an MxN matrix
- *         is 0, its entire row and column are set to 0.
+ * Problem: Write an algorithm such that if an element in an MxN matrix is 0,
+ * its entire row and column are set to 0.
  *
- *         Solution: We can reduce the space to O(1) by using the first row as a
- *         replacement for the row array and the first column as a replacement
- *         for the column array. This works as follows: 
- *         1. Check if the first row and first column have any zeros, and set 
- *         variables rowHasZero and  columnHasZero. (We'll nullify the first row and 
- *         first column later, if necessary.) 
- *         2. Iterate through the rest of the matrix, seeing matrix[i][0) and 
- *         matrix[0) [j] to zero whenever there's a zero in
- *         matrix[i][j]. 
- *         3. Iterate through rest of matrix, nullifying row i if
- *         there's a zero in matrix[i][0]. 
- *         4. Iterate through rest of matrix,
- *         nullifying column j if there's a zero in matrix[ 0][ j]. 
- *         5. Nullify the first row and first column, if necessary (based on values from Step 1).
+ * Solution: We can reduce the space to O(1) by using the first row as a
+ * replacement for the row array and the first column as a replacement for the
+ * column array. This works as follows: 1. Check if the first row and first
+ * column have any zeros, and set variables rowHasZero and columnHasZero. (We'll
+ * nullify the first row and first column later, if necessary.) 2. Iterate
+ * through the rest of the matrix, seeing matrix[i][0) and matrix[0) [j] to zero
+ * whenever there's a zero in matrix[i][j]. 3. Iterate through rest of matrix,
+ * nullifying row i if there's a zero in matrix[i][0]. 4. Iterate through rest
+ * of matrix, nullifying column j if there's a zero in matrix[ 0][ j]. 5.
+ * Nullify the first row and first column, if necessary (based on values from
+ * Step 1).
  *
  */
 public class ZeroMatrix {

src/chapter02LinkedList/DeleteMiddleNode.java

@@ -2,18 +2,12 @@
 
 /**
  * 
- * @author chengfeili 
- * Jun 19, 2017 9:33:21 PM
+ * Problem: Implement an algorithm to delete a node in the middle (i.e., any
+ * node but the first and last node, not necessarily the exact middle) of a
+ * singly linked list, given only access to that node.
  * 
- *         Problem: Implement an algorithm to delete a node in the middle (i.e.,
- *         any node but the first and last node, not necessarily the exact
- *         middle) of a singly linked list, given only access to that node.
- *         
- *         EXAMPLE lnput:the node c from the linked list a->b->c->d->e->f
- *         Result: nothing is returned, but the new linked list looks like
- *         a->b->d->e->f
- *
- *         Solution:
+ * EXAMPLE lnput:the node c from the linked list a->b->c->d->e->f Result:
+ * nothing is returned, but the new linked list looks like a->b->d->e->f
  *
  */
 public class DeleteMiddleNode {