refactor 446

fishercoder1534 · fishercoder1534 · commit 6466e2be2c77 · 2020-07-11T08:47:15.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_446.java b/src/main/java/com/fishercoder/solutions/_446.java
@@ -3,46 +3,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**
- * 446. Arithmetic Slices II - Subsequence
- *
- * A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
-
- For example, these are arithmetic sequences:
-
- 1, 3, 5, 7, 9
- 7, 7, 7, 7
- 3, -1, -5, -9
-
- The following sequence is not arithmetic.
-
- 1, 1, 2, 5, 7
-
- A zero-indexed array A consisting of N numbers is given. A subsequence slice of that array is any sequence of integers (P0, P1, ..., Pk) such that 0 ≤ P0 < P1 < ... < Pk < N.
-
- A subsequence slice (P0, P1, ..., Pk) of array A is called arithmetic if the sequence A[P0], A[P1], ..., A[Pk-1], A[Pk] is arithmetic. In particular, this means that k ≥ 2.
-
- The function should return the number of arithmetic subsequence slices in the array A.
-
- The input contains N integers. Every integer is in the range of -231 and 231-1 and 0 ≤ N ≤ 1000. The output is guaranteed to be less than 231-1.
-
-
- Example:
-
- Input: [2, 4, 6, 8, 10]
-
- Output: 7
-
- Explanation:
- All arithmetic subsequence slices are:
- [2,4,6]
- [4,6,8]
- [6,8,10]
- [2,4,6,8]
- [4,6,8,10]
- [2,4,6,8,10]
- [2,6,10]
- */
 public class _446 {
     public static class Solution1 {
         /**
