remove package and change tab size to 2

Author: andavid

src/com/andavid/leetcode/_026/Solution.java

@@ -1,29 +1,27 @@
-package com.andavid.leetcode._026;
+class Solution {
+  public int removeDuplicates(int[] nums) {
+    int len = nums.length;
+    if (len <= 1) return len;
 
-public class Solution {
-    public int removeDuplicates(int[] nums) {
-        int len = nums.length;
-        if (len <= 1) return len;
-
-        int tail = 1;
-        for (int i = 1; i < len; i++) {
-            if (nums[i] != nums[i - 1]) {
-                nums[tail++] = nums[i];
-            }
-        }
-
-        return tail;
+    int tail = 1;
+    for (int i = 1; i < len; i++) {
+      if (nums[i] != nums[i - 1]) {
+        nums[tail++] = nums[i];
+      }
     }
 
-    public static void main(String[] args) {
-        Solution solution = new Solution();
-        int[] nums = {1, 1, 2, 3, 3, 3};
+    return tail;
+  }
+
+  public static void main(String[] args) {
+    Solution solution = new Solution();
+    int[] nums = {1, 1, 2, 3, 3, 3};
 
-        int len = solution.removeDuplicates(nums);
-        System.out.println("length = " + len);
+    int len = solution.removeDuplicates(nums);
+    System.out.println("length = " + len);
 
-        for (int i = 0; i < len; i++) {
-            System.out.print(nums[i] + (i == len - 1 ? "" : ", "));
-        }
+    for (int i = 0; i < len; i++) {
+      System.out.print(nums[i] + (i == len - 1 ? "" : ", "));
     }
+  }
 }

src/com/andavid/leetcode/_121/Solution.java

@@ -1,28 +1,26 @@
-package com.andavid.leetcode._121;
-
-public class Solution {
-    public int maxProfit(int[] prices) {
-        int max = 0;
-        int min = Integer.MAX_VALUE;
-        int len = prices.length;
-        for (int i = 0; i < len; i++) {
-            if (prices[i] < min) {
-                min = prices[i];
-            } else {
-                int delta = prices[i] - min;
-                if (delta > max) {
-                    max = delta;
-                }
-            }
+class Solution {
+  public int maxProfit(int[] prices) {
+    int max = 0;
+    int min = Integer.MAX_VALUE;
+    int len = prices.length;
+    for (int i = 0; i < len; i++) {
+      if (prices[i] < min) {
+        min = prices[i];
+      } else {
+        int delta = prices[i] - min;
+        if (delta > max) {
+          max = delta;
         }
-        return max;
+      }
     }
+    return max;
+}
 
-    public static void main(String[] args) {
-        Solution solution = new Solution();
-        int[] prices1 = {7, 1, 5, 3, 6, 4};
-        int[] prices2 = {7, 6, 4, 3, 1};
-        System.out.println(solution.maxProfit(prices1));
-        System.out.println(solution.maxProfit(prices2));
-    }
+  public static void main(String[] args) {
+    Solution solution = new Solution();
+    int[] prices1 = {7, 1, 5, 3, 6, 4};
+    int[] prices2 = {7, 6, 4, 3, 1};
+    System.out.println(solution.maxProfit(prices1));
+    System.out.println(solution.maxProfit(prices2));
+  }
 }

src/com/andavid/leetcode/_122/Solution.java

@@ -1,20 +1,18 @@
-package com.andavid.leetcode._122;
-
-public class Solution {
-    public int maxProfit(int[] prices) {
-        int maxProfit = 0;
-        int len = prices.length;
-        for (int i = 1; i < len; i++) {
-            if (prices[i] > prices[i - 1]) {
-                maxProfit += prices[i] - prices[i - 1];
-            }
-        }
-        return maxProfit;
+class Solution {
+  public int maxProfit(int[] prices) {
+    int maxProfit = 0;
+    int len = prices.length;
+    for (int i = 1; i < len; i++) {
+      if (prices[i] > prices[i - 1]) {
+        maxProfit += prices[i] - prices[i - 1];
+      }
     }
+    return maxProfit;
+  }
 
-    public static void main(String[] args) {
-        Solution solution = new Solution();
-        System.out.println(solution.maxProfit(new int[]{7, 1, 5, 3, 6, 4}));
-        System.out.println(solution.maxProfit(new int[]{7, 6, 4, 3, 1}));
-    }
+  public static void main(String[] args) {
+    Solution solution = new Solution();
+    System.out.println(solution.maxProfit(new int[]{7, 1, 5, 3, 6, 4}));
+    System.out.println(solution.maxProfit(new int[]{7, 6, 4, 3, 1}));
+  }
 }

src/com/andavid/leetcode/_189/Solution.java

@@ -1,29 +1,27 @@
-package com.andavid.leetcode._189;
+class Solution {
+  public void rotate(int[] nums, int k) {
+    int n = nums.length;
+    k %= n;
+    reverse(nums, 0, n - k - 1);
+    reverse(nums, n - k, n - 1);
+    reverse(nums, 0, n - 1);
+  }
 
-public class Solution {
-    public void rotate(int[] nums, int k) {
-        int n = nums.length;
-        k %= n;
-        reverse(nums, 0, n - k - 1);
-        reverse(nums, n - k, n - 1);
-        reverse(nums, 0, n - 1);
+  private void reverse(int[] nums, int from, int to) {
+    while (from < to) {
+      int temp = nums[from];
+      nums[from++] = nums[to];
+      nums[to--] = temp;
     }
+  }
 
-    private void reverse(int[] nums, int from, int to) {
-        while (from < to) {
-            int temp = nums[from];
-            nums[from++] = nums[to];
-            nums[to--] = temp;
-        }
-    }
-
-    public static void main(String[] args) {
-        Solution solution = new Solution();
-        int[] nums = {1, 2, 3, 4, 5, 6, 7};
-        solution.rotate(nums, 3);
-        int len = nums.length;
-        for (int i = 0; i < len; i++) {
-            System.out.print(nums[i] + (i == len - 1 ? "" : ", "));
-        }
+  public static void main(String[] args) {
+    Solution solution = new Solution();
+    int[] nums = {1, 2, 3, 4, 5, 6, 7};
+    solution.rotate(nums, 3);
+    int len = nums.length;
+    for (int i = 0; i < len; i++) {
+      System.out.print(nums[i] + (i == len - 1 ? "" : ", "));
     }
+  }
 }