2017-04-11

Author: lxfgit

src/Tree/TreeDept.java

@@ -0,0 +1,35 @@
+package Tree;
+
+import org.junit.Test;
+
+/**
+ * Created by LXF on 2017/4/11.
+ */
+public class TreeDept {
+    public int TreeDepth(TreeNode root) {
+        if (root == null)
+            return 0;
+
+        int l = TreeDepth(root.left);
+        int r = TreeDepth(root.right);
+
+        if (l >= r)
+            return l + 1;
+        else
+            return r + 1;
+    }
+
+    @Test
+    public void test() {
+        TreeDept treeDept = new TreeDept();
+        TreeNode treeNode1 = new TreeNode(1);
+        TreeNode treeNode2 = new TreeNode(2);
+        TreeNode treeNode3 = new TreeNode(3);
+        TreeNode treeNode4 = new TreeNode(4);
+        treeNode1.left = treeNode2;
+        treeNode1.right = treeNode3;
+        treeNode2.right = treeNode4;
+
+        System.out.println(treeDept.TreeDepth(treeNode1));
+    }
+}

src/Tree/TreeNode.java

@@ -0,0 +1,16 @@
+package Tree;
+
+/**
+ * Created by LXF on 2017/4/11.
+ */
+public class TreeNode {
+    int val = 0;
+    TreeNode left = null;
+    TreeNode right = null;
+
+    public TreeNode(int val) {
+        this.val = val;
+
+    }
+
+}

src/linkedlist/printCommonPart/PrintCommonPart.java renamed to src/linkedlist/PrintCommonPart.java

@@ -1,4 +1,4 @@
-package linkedlist.printCommonPart;
+package linkedlist;
 
 import linkedlist.common.Node;
 import org.junit.Test;

src/linkedlist/PrintListFromTailToHead.java

@@ -0,0 +1,43 @@
+package linkedlist;
+
+/**
+ * Created by LXF on 2017/3/28.
+ */
+
+import linkedlist.common.ListNode;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+
+
+public class PrintListFromTailToHead {
+    public static ArrayList<Integer> printListFromTailToHead(ListNode listNode) {
+        ArrayList<Integer> arrayList = new ArrayList<>();
+        ListNode pre, next;
+        pre = next = null;
+        while (listNode != null) {
+            next = listNode.next;
+            listNode.next = pre;
+            pre = listNode;
+            listNode = next;
+        }
+        while (pre != null) {
+            arrayList.add(pre.val);
+            pre = pre.next;
+        }
+        return arrayList;
+    }
+
+    public static void main(String[] args) {
+        ListNode n1 = new ListNode(1);
+        ListNode n2 = new ListNode(2);
+        ListNode n3 = new ListNode(3);
+        n1.next = n2;
+        n2.next = n3;
+
+        Iterator iterator = printListFromTailToHead(n1).iterator();
+        while (iterator.hasNext()) {
+            System.out.println(iterator.next());
+        }
+    }
+}

src/linkedlist/removeByRatio/RemoveByRatio.java renamed to src/linkedlist/RemoveByRatio.java

@@ -1,4 +1,4 @@
-package linkedlist.removeByRatio;
+package linkedlist;
 
 import linkedlist.common.Node;
 import org.junit.Test;

src/linkedlist/removeDlastKthNode/removeDlastKthNode.java renamed to src/linkedlist/RemoveDlastKthNode.java

@@ -1,4 +1,4 @@
-package linkedlist.removeDlastKthNode;
+package linkedlist;
 
 import linkedlist.common.DNode;
 import org.junit.Test;

src/linkedlist/removeLastKthNode/RemoveLastKthNode.java renamed to src/linkedlist/RemoveLastKthNode.java

@@ -1,4 +1,4 @@
-package linkedlist.removeLastKthNode;
+package linkedlist;
 
 import linkedlist.common.Node;
 import org.junit.Test;

src/linkedlist/removeMiddleNode/RemoveMiddleNode.java renamed to src/linkedlist/RemoveMiddleNode.java

@@ -1,4 +1,4 @@
-package linkedlist.removeMiddleNode;
+package linkedlist;
 
 import linkedlist.common.DNode;
 import org.junit.Test;

src/linkedlist/reserveList/ReserveList.java renamed to src/linkedlist/ReserveList.java

@@ -1,4 +1,4 @@
-package linkedlist.reserveList;
+package linkedlist;
 
 import linkedlist.common.DNode;
 import linkedlist.common.Node;

src/linkedlist/common/ListNode.java

@@ -0,0 +1,13 @@
+package linkedlist.common;
+
+/**
+ * Created by LXF on 2017/3/28.
+ */
+public class ListNode {
+    public int val;
+    public ListNode next = null;
+
+    public ListNode(int val) {
+        this.val = val;
+    }
+}