chenchw的博客

常见的大O阶1、线性阶2、平方阶3、常数阶4、对数阶案例一：案例二：案例三：

class Solution { public boolean isPalindrome(int x) { int res = 0;//将转换成的结果初试化为res；这道题其实和取余有点像 if(x < 0) return false;//是负数的时候直接返回false； if(x>0){ int x1=x;//可以不要这个 int temp = 0; .

import java.util.Scanner; public class HashTable { public static void main(String[] args) { HashTab hashTab = new HashTab(7); //写一个菜单2 String key = ""; Scanner scanner = new Scanner(System.in); while (true) { .

public class CircleArrayQueue { private int maxSize; private int front; private int rear; private int[] arr; //创建队列的构造器 public CircleArrayQueue(int maxSize) { this.maxSize = maxSize; arr = new int[maxSize]; .

public class AparseArr { public static void main(String[] args) { //创建一个二位数组 int charArr[][] = new int[11][11]; charArr[1][2] = 1; charArr[2][3] = 2; System.out.println("原始的二维数组"); for (int[] row : charA.

package test; public class Test { public static void main(String[] args) { ListNode<Integer> first = null; ListNode<Integer> pre = null;//这里面的pre就是个工具人。 //首先我先创建循环链表 for (int i = 1; i <= 41 ; i++) { .

Node 节点： package linerList; public class Node<T> { public T data; public Node next; public Node() { } public Node(T data) { this.data = data; } public Node(T data, Node next) { this.data = data; .

public class Node<T> { public T item; public Node next; public Node(T item, Node next) { this.item = item; this.next = next; } }