refactor 240

fishercoder1534 · fishercoder1534 · commit a073e9d6df03 · 2020-05-23T08:11:31.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_240.java b/src/main/java/com/fishercoder/solutions/_240.java
@@ -1,28 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 240. Search a 2D Matrix II
- *
- * Write an efficient algorithm that searches for a value in an m x n matrix.
- * This matrix has the following properties:
-
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
- For example,
-
- Consider the following matrix:
-
- [
- [1,   4,  7, 11, 15],
- [2,   5,  8, 12, 19],
- [3,   6,  9, 16, 22],
- [10, 13, 14, 17, 24],
- [18, 21, 23, 26, 30]
- ]
- Given target = 5, return true.
-
- Given target = 20, return false.
- */
 public class _240 {
 
     public static class Solution1 {
