java程序设计第二十二章参考答案01，02，08

01

public class Test2201 {
public static void main(String[] args) {
    String string;
    Scanner input=new Scanner(System.in);
    System.out.print("Enter a string:");
    string=input.nextLine();
    char a=string.charAt(0);
    int sum=1,max=0,location=-1;
    ArrayList<String> arraylist=new ArrayList<>();
    arraylist.add(""+a);
    for(int i=1;i<string.length();i++) 
        if(a<string.charAt(i)) {
            a=string.charAt(i);
            arraylist.set(arraylist.size()-1, arraylist.get(arraylist.size()-1)+a);
            sum++;
        }
        else {
            a=string.charAt(i);
            arraylist.add(""+a);
            if(max<sum) {
                max=sum;
                location++;
            }
            sum=1;

        }
    if(max<sum) {
        max=sum;
        location++;
    }

    System.out.println(arraylist.get(location));
}

}

02

public class Test2202 {
public static void main(String[] args) {
    System.out.print("Enter a string:");
    Scanner input=new Scanner(System.in);
    String string=input.nextLine();
    int max=0,location=-1;
    ArrayList<String> arraylist=new ArrayList<>();      
    for(int i=0;i<string.length();i++) {
        arraylist.add(""+string.charAt(i));
        char a=string.charAt(i);
        for(int j=i+1;j<string.length();j++) {
            if(a<string.charAt(j)) {
                arraylist.set(arraylist.size()-1, arraylist.get(arraylist.size()-1)+string.charAt(j));
                a=string.charAt(j);
            }


        }
        if(max<arraylist.get(arraylist.size()-1).length()) {
            max=arraylist.get(arraylist.size()-1).length();
            location++;
        }
    }
    System.out.println(arraylist.get(location));

}

}

08

public class Test2208 {
public static final int arraySize=10000;
public static void main(String[] args) throws IOException {
    RandomAccessFile inout=new RandomAccessFile("PrimeNumber.dat", "rw");
    final long N=100000002;
    long[] primeNumbers=new long[arraySize];
    long number;
    if(inout.length()==0) {
        number=1;
    }
    else {
        inout.seek(inout.length()-8);
        number=inout.readLong();
    }
    int squareRoot=1;
    newNumber:while(number<=N) {
        number++;
        inout.seek(0);
        if(squareRoot*squareRoot<number) {
            squareRoot++;
        }
        while(inout.getFilePointer()<inout.length()) {
            int size=readNextBatch(primeNumbers,inout);
            for(int k=0;k<size&&primeNumbers[k]<=squareRoot;k++) {
                if(number%primeNumbers[k]==0) {
                    continue newNumber;
                }
            }
        }
        inout.seek(inout.length());
        inout.writeLong(number);

    }
    inout.seek(0);
    while(inout.getFilePointer()<inout.length()) {
        System.out.print(inout.readLong()+" ");
    }
    inout.close();

}
public static int readNextBatch(long[] primeNumbers,RandomAccessFile inout) {
    int size=0;
    try {while(inout.getFilePointer()<inout.length()&&size<arraySize) {
        primeNumbers[size++]=inout.readLong();
        }
    }
    catch(Exception ex) {
        ex.printStackTrace();
    }
    return size;
}


}