init

Author: gaoyanfei3

.gitignore

@@ -0,0 +1,41 @@
+target/
+!.mvn/wrapper/maven-wrapper.jar
+!**/src/main/**/target/
+!**/src/test/**/target/
+
+### IntelliJ IDEA ###
+.idea/modules.xml
+.idea/jarRepositories.xml
+.idea/compiler.xml
+.idea/libraries/
+*.iws
+*.iml
+*.ipr
+
+target/
+
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+build/
+!**/src/main/**/build/
+!**/src/test/**/build/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store

.idea/.gitignore

@@ -0,0 +1,10 @@
+# leetcode-cn.com 题解
+
+## easy
+[easy题解](src/main/java/com/mine/study/easy/easy.md)
+
+## medium
+[medium题解](src/main/java/com/mine/study/medium/medium.md)
+
+## hard
+[hard题解](src/main/java/com/mine/study/hard/hard.md)

.idea/codeStyles/Project.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0"
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+
+    <groupId>com.mine.study</groupId>
+    <artifactId>leetcode-algorithm</artifactId>
+    <version>1.0-SNAPSHOT</version>
+
+    <properties>
+        <java.version>8</java.version>
+        <project.encoding>UTF-8</project.encoding>
+        <maven.compiler.source>${java.version}</maven.compiler.source>
+        <maven.compiler.target>${java.version}</maven.compiler.target>
+        <maven.compiler.encoding>${project.encoding}</maven.compiler.encoding>
+        <project.build.sourceEncoding>${project.encoding}</project.build.sourceEncoding>
+        <project.reporting.outputEncoding>${project.encoding}</project.reporting.outputEncoding>
+
+    </properties>
+
+</project>

.idea/codeStyles/codeStyleConfig.xml

@@ -0,0 +1,86 @@
+package com.mine.study;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+/**
+ * 二叉搜索树
+ */
+public class BST {
+
+    public TreeNode root;
+
+    public BST() {
+        root = null;
+    }
+
+
+    public void addNode(int value) {
+        root = addNode(root, value);
+    }
+
+    // 向以node为根的二分搜索树中插入元素e，递归算法
+    // 返回插入新节点后二分搜索树的根
+    private TreeNode addNode(TreeNode node, int value) {
+        if (node == null) {
+            return new TreeNode(value);
+        }
+        if (value < node.val) {
+            node.left = addNode(node.left, value);
+        } else if (value > node.val) {
+            node.right = addNode(node.right, value);
+        }
+        return node;
+    }
+
+    // 中序遍历
+    public void inOrder() {
+        inOrder(root);
+    }
+
+    // 指定节点 中序遍历
+    public void inOrderNode(TreeNode root) {
+        inOrder(root);
+    }
+
+    private void inOrder(TreeNode node) {
+        if (node == null) {
+            return;
+        }
+        inOrder(node.left);
+        System.out.println(node.val);
+        inOrder(node.right);
+    }
+
+
+    // 前序遍历
+    public void preOrder() {
+        preOrder(root);
+    }
+
+    private void preOrder(TreeNode node) {
+        if (node == null) {
+            return;
+        }
+        System.out.println(node.val);
+        preOrder(node.left);
+        preOrder(node.right);
+    }
+
+    //层序遍历
+    public void levelOrder() {
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        while(!queue.isEmpty()) {
+            TreeNode node = queue.remove();
+            System.out.println(node.val);
+
+            if (node.left != null) {
+                queue.add(node.left);
+            }
+            if (node.right != null) {
+                queue.add(node.right);
+            }
+        }
+    }
+}

.idea/misc.xml

@@ -0,0 +1,46 @@
+package com.mine.study;
+
+/**
+ * 单向链表节点
+ */
+public class ListNode {
+    public int val;
+    public ListNode next;
+
+    public ListNode(int x) {
+        val = x;
+    }
+
+    // 链表节点的构造函数
+    // 使用arr为参数，创建一个链表，当前的ListNode为链表头结点
+    public ListNode(int[] arr) {
+        if (arr == null || arr.length == 0)
+            throw new IllegalArgumentException("arr can not be empty");
+
+        this.val = arr[0];
+        ListNode cur = this;
+        for (int i = 1; i < arr.length; i++) {
+            cur.next = new ListNode(arr[i]);
+            cur = cur.next;
+        }
+    }
+
+    // 以当前节点为头结点的链表信息字符串  当测试有环链表的时候 不能覆盖的toString()方法 会内存溢出
+    /*@Override
+    public String toString(){
+
+        StringBuilder s = new StringBuilder();
+        ListNode cur = this;
+        while(cur != null){
+            s.append(cur.val + "->");
+            cur = cur.next;
+        }
+        s.append("NULL");
+        return s.toString();
+    }*/
+
+    @Override
+    public String toString() {
+        return String.valueOf(this.val);
+    }
+}