mrfuhe的博客

算法与数据结构代码存档import java.util.Arrays; import java.util.Scanner;class Queue{ private int maxSize; private long[] queArray; private int front; private int rear; private int nItems

算法准备之数据结构 import java.util.Arrays; import java.util.Scanner; import java.util.Stack; class Node{ public int iData; public double dData; public Node leftChild; public Node rightC

public class TestForString{ public static void main(String[] arg){} }class StackX{ private final int SIZE = 20; private int[] st; private int top;public StackX(){ st = new int[S