refactor 279

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_279.java

@@ -2,12 +2,6 @@
 
 import java.util.Arrays;
 
-/**
- * 279. Perfect Squares
- *
- * Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.
- * For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9.
- */
 public class _279 {
     public static class Solution1 {
         public int numSquares(int n) {