edit 202

fishercoder1534 · fishercoder1534 · commit 32c8f2e9d9d4 · 2017-07-25T11:42:31.000-07:00
diff --git a/README.md b/README.md
@@ -384,7 +384,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_206.java)| O(n)|O(1) | Easy | Linked List
 |205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../../blmaster/src/94fishercoder/algorithms/IsomorphicStrings.java)| O(n)|O(1) | Easy
 |204|[Count Primes](https://leetcode.com/problems/count-primes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_204.java)| O(sqrt(n))|O(n) | Easy
-|202|[Happy Number](https://leetcode.com/problems/happy-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/HappyNumber.java)| O(k)|O(k) | Easy
+|202|[Happy Number](https://leetcode.com/problems/happy-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_202.java)| O(k)|O(k) | Easy
 |201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_201.java)| O(min(m,n))|O(1) | Medium | Bit Manipulation
 |200|[Number of Islands](https://leetcode.com/problems/number-of-islands/)|[Union Find](../master/src/main/java/com/fishercoder/solutions/_200UnionFind.java) [DFS](../master/MEDIUM/src/medium/_200DFS.java)| O(m*n)|O(m*n) | Medium| Union Find, DFS
 |199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_199.java)| O(n)|O(n)| Medium | BFS 
diff --git a/src/main/java/com/fishercoder/solutions/_202.java b/src/main/java/com/fishercoder/solutions/_202.java
@@ -3,16 +3,20 @@
 import java.util.HashSet;
 import java.util.Set;
 /**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.
+ 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
 
  12 + 92 = 82
  82 + 22 = 68
  62 + 82 = 100
  12 + 02 + 02 = 1*/
-public class HappyNumber {
+public class _202 {
 
     public static boolean isHappy(int n) {
         if(n == 1) return true;
