添加所有class的包名

Author: JavaScalaDeveloper

change/scripts/README.md renamed to change/README.md

@@ -3,4 +3,6 @@
 
 [//]: # (- 正则匹配[English Version]([\s\S]*?))
 
-- 清除空格 
+- 清除空格 
+- 给所有class添加package：AddPackagePrefix
+- 合并所有md：MergeMdFiles

solution/0000-0099/0001.Two Sum/Solution.java

@@ -1,5 +1,16 @@
-class Solution {
-    public int[] twoSum(int[] nums, int target) {
+package com.solution._0001;
+import change.datastructure.*;
+import change.tools.listnode.ArrayUtils;
+
+import java.util.*;
+public class Solution {
+    public static void main(String[] args) {
+        int[] arr = {1, 2, 6, 3, 8, 5};
+        int target = 7;
+        int[] result = twoSum(arr, target);
+        System.out.println(ArrayUtils.toList(result));
+    }
+    public static int[] twoSum(int[] nums, int target) {
         Map<Integer, Integer> m = new HashMap<>();
         for (int i = 0;; ++i) {
             int x = nums[i];
@@ -10,4 +21,4 @@ public int[] twoSum(int[] nums, int target) {
             m.put(x, i);
         }
     }
-}
+}

solution/0000-0099/0002.Add Two Numbers/Solution.java

@@ -8,7 +8,10 @@
  *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  * }
  */
-class Solution {
+package com.solution._0002;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
         ListNode dummy = new ListNode(0);
         int carry = 0;
@@ -23,4 +26,4 @@ public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
         }
         return dummy.next;
     }
-}
+}

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0003;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public int lengthOfLongestSubstring(String s) {
         Set<Character> ss = new HashSet<>();
         int i = 0, ans = 0;
@@ -12,4 +15,4 @@ public int lengthOfLongestSubstring(String s) {
         }
         return ans;
     }
-}
+}

solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0004;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public double findMedianSortedArrays(int[] nums1, int[] nums2) {
         int m = nums1.length;
         int n = nums2.length;
@@ -24,4 +27,4 @@ private int findKth(int[] nums1, int i, int[] nums2, int j, int k) {
         }
         return findKth(nums1, i, nums2, j + k / 2, k - k / 2);
     }
-}
+}

solution/0000-0099/0005.Longest Palindromic Substring/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0005;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public String longestPalindrome(String s) {
         int n = s.length();
         boolean[][] dp = new boolean[n][n];
@@ -18,4 +21,4 @@ public String longestPalindrome(String s) {
         }
         return s.substring(start, start + mx);
     }
-}
+}

solution/0000-0099/0006.Zigzag Conversion/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0006;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public String convert(String s, int numRows) {
         if (numRows == 1) {
             return s;
@@ -19,4 +22,4 @@ public String convert(String s, int numRows) {
         }
         return ans.toString();
     }
-}
+}

solution/0000-0099/0007.Reverse Integer/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0007;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public int reverse(int x) {
         int ans = 0;
         for (; x != 0; x /= 10) {
@@ -9,4 +12,4 @@ public int reverse(int x) {
         }
         return ans;
     }
-}
+}

solution/0000-0099/0008.String to Integer (atoi)/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0008;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public int myAtoi(String s) {
         if (s == null) return 0;
         int n = s.length();
@@ -19,4 +22,4 @@ public int myAtoi(String s) {
         }
         return sign * res;
     }
-}
+}

solution/0000-0099/0009.Palindrome Number/Solution.java

@@ -1,4 +1,7 @@
-class Solution {
+package com.solution._0009;
+import change.datastructure.*;
+import java.util.*;
+public class Solution {
     public boolean isPalindrome(int x) {
         if (x < 0 || (x > 0 && x % 10 == 0)) {
             return false;
@@ -9,4 +12,4 @@ public boolean isPalindrome(int x) {
         }
         return x == y || x == y / 10;
     }
-}
+}