update

genkimaru · genkimaru · commit e5fcedecddb6 · 2024-04-17T21:59:46.000+08:00
diff --git a/src/main/java/com/leetcode/Practice10_MergeSortedLists.java b/src/main/java/com/leetcode/Practice10_MergeSortedLists.java
diff --git a/src/main/java/com/leetcode/Practice11.java b/src/main/java/com/leetcode/Practice11.java
diff --git a/src/main/java/com/leetcode/array/ArrayOne.java b/src/main/java/com/leetcode/array/ArrayOne.java
@@ -1,11 +1,11 @@
-package com.leetcode;
+package com.leetcode.array;
 
 import java.util.ArrayList;
 import java.util.HashMap;
 import java.util.function.BiConsumer;
 import java.util.List;
 
-public class Practice5 {
+public class ArrayOne {
     /**
      *
      * find the disappeared numbers in array
diff --git a/src/main/java/com/leetcode/array/ArrayOneS.java b/src/main/java/com/leetcode/array/ArrayOneS.java
@@ -1,6 +1,6 @@
-package com.leetcode;
+package com.leetcode.array;
 
-public class Practice5_s {
+public class ArrayOneS {
 
 
     public static void main(String[] args) {
diff --git a/src/main/java/com/leetcode/doublepointer/DoublePointerOne.java b/src/main/java/com/leetcode/doublepointer/DoublePointerOne.java
@@ -1,6 +1,6 @@
-package com.leetcode;
+package com.leetcode.doublepointer;
 
-public class Practice3 {
+public class DoublePointerOne {
 
     /**
      *
@@ -50,4 +50,36 @@ public static void main(String[] args) {
         }
 
     }
+
+    /**
+     *
+     * name: Container With Most Water
+     *
+     */
+    public static class Practice6 {
+        public static  int maxArea(int[] height) {
+            int maxarea = 0;
+            for(int i = 1 ; i < height.length ; i ++){
+                for( int j = height.length -1 ; j > i ; j --){
+                    int minHeight = Math.min(height[j], height[i]);
+                    int area = (j-i) *  minHeight;
+                    if(area > maxarea){
+                        maxarea = area;
+                    }
+                }
+            }
+
+            return maxarea;
+        }
+
+
+        public static void main(String[] args) {
+            // test case 1
+            int[] height = {1,8,6,2,5,4,8,3,7};
+            // test case 2
+           //  int[] height = {1,1};
+            int maxArea =  maxArea(height);
+            System.out.println(maxArea);
+        }
+    }
 }
diff --git a/src/main/java/com/leetcode/doublepointer/DoublePointerThree.java b/src/main/java/com/leetcode/doublepointer/DoublePointerThree.java
@@ -1,6 +1,11 @@
-package com.leetcode;
+package com.leetcode.doublepointer;
 
-public class Practice6 {
+/**
+ *
+ * Container With Most Water
+ *
+ */
+public class DoublePointerThree {
     public static  int maxArea(int[] height) {
         int maxarea = 0;
         for(int i = 1 ; i < height.length ; i ++){
@@ -21,8 +26,8 @@ public static void main(String[] args) {
         // test case 1
         int[] height = {1,8,6,2,5,4,8,3,7};
         // test case 2
-       //  int[] height = {1,1};
+        //  int[] height = {1,1};
         int maxArea =  maxArea(height);
         System.out.println(maxArea);
     }
-}
+}
diff --git a/src/main/java/com/leetcode/doublepointer/DoublePointerTwo.java b/src/main/java/com/leetcode/doublepointer/DoublePointerTwo.java
@@ -1,8 +1,8 @@
-package com.leetcode;
+package com.leetcode.doublepointer;
 
-public class Practice4 {
+public class DoublePointerTwo {
 
-    /**
+    /** move zero
      *
      * [1, 3 ,0 ,4 ,0 ,2, 5] =>  [1,3,4,2,5,0,0]
      * require in-place sort
diff --git a/src/main/java/com/leetcode/dynamicplan/DynPlanOne.java b/src/main/java/com/leetcode/dynamicplan/DynPlanOne.java
@@ -1,14 +1,14 @@
-package com.leetcode;
+package com.leetcode.dynamicplan;
 
 import java.io.IOException;
 import java.util.Scanner;
 
 
 /**
- *
- *  fibonacci sequence / go upstairs 1/2 steps
+ *   name:  Climbing Stairs
+ *    fibonacci sequence
  */
-public class Practice1 {
+public class DynPlanOne {
 
     public static int fibonacci(int n) {
         if (n == 1) {
diff --git a/src/main/java/com/leetcode/hash/HashOne.java b/src/main/java/com/leetcode/hash/HashOne.java
@@ -1,15 +1,12 @@
-package com.leetcode;
-
-import java.util.Arrays;
+package com.leetcode.hash;
 
 /**
- *
- *  arr = [2 , 7, 9 , 11 ] , target number 9
- *  arr[0] + arr[1] = 9
+ * two sum
+ * arr = [2 , 7, 9 , 11 ] , target number 9
+ * arr[0] + arr[1] = 9
  */
 
-public class Practice2 {
-
+public class HashOne {
 
 
     public static void main(String[] args) {
@@ -19,32 +16,31 @@ public static void main(String[] args) {
         // the other one loop the array from smallest to largest , test the sum equals to the target number or not,
         //if the sum is greater than target number , then break the current loop.
         int target = 9;
-        int[] arr =  {2,7,9,11};
+        int[] arr = {2, 7, 9, 11};
 
         int[] newarr = new int[arr.length];
-        for (int i =0 , j = 0 ;  i < arr.length ; i ++){
-            if(target > arr[i]){
+        for (int i = 0, j = 0; i < arr.length; i++) {
+            if (target > arr[i]) {
                 newarr[j] = arr[i];
                 j++;
             }
         }
         System.out.println(newarr.length);
 
-        for(int i = newarr.length -1 ; i > 0 ; i --){
-            for(int j = 0; j < newarr.length; j ++){
-                if(newarr[i] + newarr[j] == target){
+        for (int i = newarr.length - 1; i > 0; i--) {
+            for (int j = 0; j < newarr.length; j++) {
+                if (newarr[i] + newarr[j] == target) {
 
                     System.out.println("Found the index : " + i + " and " + j);
                     System.exit(0);
-                }else if (newarr[i] + newarr[j] > target){
+                } else if (newarr[i] + newarr[j] > target) {
                     break;
                 }
 
             }
         }
 
 
-
     }
 }
 
diff --git a/src/main/java/com/leetcode/linkedlist/LinkedListOne.java b/src/main/java/com/leetcode/linkedlist/LinkedListOne.java
@@ -1,12 +1,12 @@
-package com.leetcode;
+package com.leetcode.linkedlist;
 
 import com.leetcode.util.ListNode;
 import com.leetcode.util.Utils;
 
 /**
- *  intersect list
+ *  name:  two intersect list
  */
-public class Practice9 {
+public class LinkedListOne {
 
 
     public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
@@ -42,7 +42,7 @@ public static void main(String[] args) {
         int[] listB = {5, 6, 1, 8, 4, 5};
 
         //  expect : int intersectVal = 8;
-        Practice9 practice9 = new Practice9();
+        LinkedListOne practice9 = new LinkedListOne();
         practice9.listAHead = Utils.buildList(listA);
         practice9.listBHead = Utils.buildList(listB );
         ListNode intersectionNode = practice9.getIntersectionNode(practice9.listAHead, practice9.listBHead);
diff --git a/src/main/java/com/leetcode/linkedlist/LinkedListTwo.java b/src/main/java/com/leetcode/linkedlist/LinkedListTwo.java
@@ -1,4 +1,4 @@
-package com.leetcode;
+package com.leetcode.linkedlist;
 
 import com.leetcode.util.ListNode;
 import com.leetcode.util.Utils;
@@ -8,7 +8,7 @@
 /**
  *  merge two list
  */
-public class Practice10 {
+public class LinkedListTwo {
 
 /*    public ListNode mergeTwoLists(ListNode head1, ListNode head2) {
         ListNode newHead, currentNode;
@@ -77,7 +77,7 @@ public static void main(String[] args) {
         int[] arr1 = {1, 2, 4}, arr2 = {1, 3, 4};
         ListNode head1 = Utils.buildList(arr1);
         ListNode head2 = Utils.buildList(arr2);
-        ListNode newHead = new Practice10().mergeTwoLists(head1, head2);
+        ListNode newHead = new LinkedListTwo().mergeTwoLists(head1, head2);
         while (newHead != null) {
             System.out.println(newHead.val);
             newHead = newHead.next;
diff --git a/src/main/java/com/leetcode/matrix/MatrixQuiz.java b/src/main/java/com/leetcode/matrix/MatrixQuiz.java
@@ -1,10 +1,8 @@
-package com.leetcode;
+package com.leetcode.matrix;
 
 import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.function.IntPredicate;
 
-public class Practice8 {
+public class MatrixQuiz {
 
     public void setZeroes(int[][] matrix) {
 
@@ -56,7 +54,7 @@ public static void main(String[] args) {
         //int[][] matrix = {{1,1,1},{1,0,1},{1,1,1}};
         // int[][] matrix = {{0,1,2,0},{3,4,5,2},{1,3,1,5}};
         int[][] matrix = {{1, 0}};
-        new Practice8().setZeroes(matrix);
+        new MatrixQuiz().setZeroes(matrix);
         for (int[] row : matrix) {
             System.out.print("[ ");
             for (int element : row) {
diff --git a/src/main/java/com/leetcode/recursion/RecursionOne.java b/src/main/java/com/leetcode/recursion/RecursionOne.java
@@ -1,4 +1,4 @@
-package com.leetcode;
+package com.leetcode.recursion;
 
 import java.util.ArrayList;
 import java.util.HashMap;
@@ -7,7 +7,7 @@
 /**
  * permutation or  arrangement problem: [1,2,3] => [1,2,3] [1,3,2] ,[2,1,3] ,[2,3,1],[3,1,2],[3,2,1]
  */
-public class Arrangement {
+public class RecursionOne {
 
     private int count;
     private ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
@@ -42,7 +42,7 @@ public void arrange(int[] arr) {
         }
     }
 
-    protected int[] restOfArr(int ele, int[] arr) {
+    public int[] restOfArr(int ele, int[] arr) {
         int[] rest = new int[arr.length - 1];
         int i = 0;
         for (int e : arr) {
@@ -57,7 +57,7 @@ protected int[] restOfArr(int ele, int[] arr) {
 
     public static void main(String[] args) {
         int[] arr = new int[]{1, 2, 3, 4, 5, 6, 7, 8};
-        Arrangement arrangement = new Arrangement();
+        RecursionOne arrangement = new RecursionOne();
         arrangement.arrange(arr);
         arrangement.result.stream().forEach(new Consumer<ArrayList<Integer>>() {
             @Override
diff --git a/src/main/java/com/leetcode/slidingwindow/SlidingWindowOne.java b/src/main/java/com/leetcode/slidingwindow/SlidingWindowOne.java
@@ -1,10 +1,11 @@
-package com.leetcode;
+package com.leetcode.slidingwindow;
 
 
 /**
- * non repeatable max substring
+ * name :  longest substring  without repeating characters.
+ *
  */
-public class Practice7 {
+public class SlidingWindowOne {
 
 
     public static int lengthOfLongestSubstring(String s) {
diff --git a/src/main/java/com/leetcode/stack/StackOne.java b/src/main/java/com/leetcode/stack/StackOne.java
@@ -0,0 +1,14 @@
+package com.leetcode.stack;
+
+/**
+ *
+ * Is Valid Perentheses
+ *
+ */
+public class StackOne {
+
+
+    public static void main(String[] args) {
+
+    }
+}
diff --git a/src/main/java/com/leetcode/tree/Practice1.java b/src/main/java/com/leetcode/tree/Practice1.java
diff --git a/src/main/java/com/leetcode/util/Utils.java b/src/main/java/com/leetcode/util/Utils.java
diff --git a/src/test/java/com/recursion/ArrangementTest.java b/src/test/java/com/recursion/ArrangementTest.java
