摘要:
package QueueTest;public class MyCircularDeque { public int kt; public int[] arr; public int head; public int tail; //构造函数,双端队列的大小为k。 public MyCircula 阅读全文
摘要:
import java.util.ArrayList;import java.util.List;class TreeNode { public int val; public TreeNode left; public TreeNode right; public TreeNode(int val 阅读全文
摘要:
package java3_30_1;class Node{ public char val; public Node left; public Node rigth; public Node(char val) { this.val = val; }}public class TestTree { 阅读全文
摘要:
public class Solution15 { //在原字符串中找子字符串,如果存在返回下标位置,如果不存在则返回-1; public int strStr(String haystack, String needle) { int i=0; if(haystack.contains(needl 阅读全文