weixin_43978420的博客

public static Queue<Integer> bfs(TreeNode root){ Queue<Integer> queue=new LinkedList<>(); Queue<TreeNode> help=new LinkedList<>(); help.offer(root); while (!help.isEmpty()){ TreeNod.

public static ListNode buildLinks(int[] arr) { ListNode head = null; for (int e : arr) { head = buildLink(head, e); } return head; } public static ListNode buildLink(ListNode head, int v) { if (hea.

例如:给定数组[1,2,2,3,4,4,3] 返回为: 代码如下: public static TreeNode buildTree(Integer[] arr){ if(arr.length==1) return new TreeNode(arr[0]); Queue<TreeNode> queue=new LinkedList<>(); TreeNode root=new TreeNode(arr[0]); que

// 大小写ASCII码固定差距 static int gap = 'a'-'A'; public static void main(String[] args) { String str = "person_first_name"; String result = parseStrToCammeCase(str); System.out.println(result); System.out.println(parseCa

KMP算法JAVA实现