P_ning的博客

循环 public static int demo(int[] arr,int num){ int start=0; int end=arr.length; while (true){ int mid = (start+end)/2; if(start>end){ return -1; } if(arr[mid]==num.

最原始的dfspublic class Main { public static void main(String[] args) { char[] arr ={'a','b','c'}; boolean[] used = {false,false,false}; char[] rs = new char[arr.length]; dfs(arr,used,rs,0);//要遍历的函数,对应位置的函数是否已被使用,存储结果,次数.

import java.util.*;public class Main{ public static void main(String[] args){ TreeNode head=new TreeNode(1); TreeNode second=new TreeNode(2); TreeNode three=new TreeNode(3); TreeNode four=new TreeNode(4); TreeN