10 2018 档案
摘要：idea切换到主分支master 然后选择自己的分支 进行Merge操作 最后进行git Repository push 操作
阅读全文
摘要：打开idea 然后New branch 然后git Repository push
阅读全文
摘要：public Node reverse(Node root){ Node newNode = null; Node node = root; while (node !=null){ Node temp = node.next; node.next =newNode; ...
阅读全文
摘要：class Node { private int data; private Node leftNode; private Node rightNode; public Node(int data, Node leftNode, Node rightNode){ this.data = data; ...
阅读全文
摘要：public void mergeSort(int[] arry, int low ,int high){ if (low < high){ int middle = ( low +high)/2 ; mergeSort(arry,low,middle); mergeSort(arry,middle+...
阅读全文
摘要：public static void quckSort(int[] arry,int low ,int high){ if (low = temp ){ high-- ; } arry[low] =arry[high] ; while (low < high && a...
阅读全文
摘要：public void heapSort(int[] arry){ int len= arry.length -1 ; for(int i = (len-1)/2 ;i>=0 ;i--){ buildHeap(arry,i,len); } for(int i = len ;i >0 ;i--){ ...
阅读全文
