update

Author: genkimaru

src/main/java/com/leetcode/linkedlist/LinkedListTwo.java renamed to src/main/java/com/leetcode/linkedlist/MergeTwoList.java

@@ -8,7 +8,7 @@
 /**
  *  merge two list
  */
-public class LinkedListTwo {
+public class MergeTwoList {
 
     public ListNode mergeTwoLists(ListNode head1, ListNode head2) {
         ArrayList<Integer>  list = new ArrayList<Integer>();
@@ -26,8 +26,6 @@ public ListNode mergeTwoLists(ListNode head1, ListNode head2) {
                 head2 = head2.next;
             }
         }
-
-
         ListNode head = Utils.buildList(list.stream().mapToInt(Integer::intValue).toArray());
         return head;
     }
@@ -37,7 +35,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 LinkedListTwo().mergeTwoLists(head1, head2);
+        ListNode newHead = new MergeTwoList().mergeTwoLists(head1, head2);
         while (newHead != null) {
             System.out.println(newHead.val);
             newHead = newHead.next;

src/main/java/com/leetcode/linkedlist/ParlindromeList.java

@@ -0,0 +1,54 @@
+package com.leetcode.linkedlist;
+
+import com.leetcode.util.ListNode;
+
+import java.util.List;
+import java.util.Stack;
+
+public class ParlindromeList {
+
+    public boolean isPalindrome(ListNode head) {
+        int len = 1;
+        ListNode curnode = head;
+        while(curnode.next != null){
+            len++;
+            curnode = curnode.next;
+        }
+        if(len % 2 == 1){
+            return false;
+        }else{
+            int i = 0;
+            curnode = head;
+            Stack<Integer> stack = new Stack<Integer>();
+            while( i < len / 2){
+                stack.push(curnode.val);
+                curnode = curnode.next;
+                i++;
+            }
+
+            while(i < len){
+                Integer pop = stack.pop();
+                if(pop != curnode.val){
+                    return false;
+                }
+                curnode = curnode.next;
+                i++;
+            }
+            return true;
+        }
+    }
+
+    public static void main(String[] args) {
+        ListNode node1 = new ListNode(1);
+        ListNode node2 = new ListNode(2);
+        ListNode node3 = new ListNode(2);
+        ListNode node4 = new ListNode(1);
+        node1.next = node2;
+        node2.next = node3;
+        node3.next = node4;
+
+        boolean b = new ParlindromeList().isPalindrome(node1);
+        System.out.println(b);
+
+    }
+}

src/main/java/com/leetcode/matrix/MatrixOne.java renamed to src/main/java/com/leetcode/matrix/MatrixSetZero.java

@@ -2,7 +2,7 @@
 
 import java.util.ArrayList;
 
-public class MatrixOne {
+public class MatrixSetZero {
 
     public void setZeroes(int[][] matrix) {
 
@@ -54,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 MatrixOne().setZeroes(matrix);
+        new MatrixSetZero().setZeroes(matrix);
         for (int[] row : matrix) {
             System.out.print("[ ");
             for (int element : row) {

src/main/java/com/leetcode/slidingwindow/SlidingWindowOne.java renamed to src/main/java/com/leetcode/slidingwindow/LongestSubstr.java

@@ -5,7 +5,7 @@
  * name :  longest substring  without repeating characters.
  *
  */
-public class SlidingWindowOne {
+public class LongestSubstr {
 
 
     public static int lengthOfLongestSubstring(String s) {