skey_online的博客

Binary Search的普遍基础写法如下：public class binarySearch { public int solution(int[] nums, int target){ if(nums == null || nums.length == 0){ return -1; } int start = 0;

Binary Tree:public class Solution { public List<Integer> preorderTraversal(TreeNode root) { ArrayList<Integer> result = new ArrayList<Integer>(); if(root == null){ retur