refactor 35

fishercoder1534 · fishercoder1534 · commit 457b738d604c · 2020-04-29T06:55:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_35.java b/src/main/java/com/fishercoder/solutions/_35.java
@@ -1,21 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 35. Search Insert Position
- *
- * Given a sorted array and a target value,
- * return the index if the target is found.
- * If not, return the index where it would be if it were inserted in order.
-
- You may assume no duplicates in the array.
-
- Here are few examples.
- [1,3,5,6], 5 → 2
- [1,3,5,6], 2 → 1
- [1,3,5,6], 7 → 4
- [1,3,5,6], 0 → 0
- */
-
 public class _35 {
 
     public static class Solution1 {
