refactor 560

fishercoder1534 · fishercoder1534 · commit a538feba1e92 · 2020-07-17T06:41:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_560.java b/src/main/java/com/fishercoder/solutions/_560.java
@@ -3,18 +3,6 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**
- * 560. Subarray Sum Equals K
- *
- * Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.
-
- Example 1:
- Input:nums = [1,1,1], k = 2
- Output: 2
- Note:
- The length of the array is in range [1, 20,000].
- The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].
- */
 public class _560 {
 
     public static class Solution1 {
