refactor 64

Author: fishercoder1534

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

@@ -1,12 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 64. Minimum Path Sum
- *
- * Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
- *
- * Note: You can only move either down or right at any point in time.
- */
 public class _64 {
     public static class Solution1 {
         /**