刷题
qq_41923555
这个作者很懒,什么都没留下…
展开
-
二叉树遍历
递归/* 先序遍历 */public void preOrderRecur(Node head) { if(head==null) return; System.out.println(head.value); preOrderRecur(head.left); preOrderRecur(head.right);}/* 中序遍历 */public...原创 2019-12-24 10:49:19 · 70 阅读 · 0 评论 -
二分查找
public class Search{ public int search(int[] arr,target){ int l = 0; int r = arr.length-1; int mid = 0; while(l<r){ mid = l+(r-l)/...原创 2019-12-18 22:53:56 · 56 阅读 · 0 评论 -
链表操作-反转链表
class Node { int val; Node next; Node(int x) { val = x; }}public class ReverseListNode { public static Node reverseNode(Node head){ Node cur = head; //当前节点 Node pr...原创 2019-12-08 15:27:46 · 85 阅读 · 0 评论