第八次作业

8

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

class Fs{
    private double x;
    private double y;   
    public Fs(double x, double y) {this.x = x; this.y = y;}
    public void show() {
        if (y == 0)
            System.out.println(x);
        else if(y<0)
            System.out.println(x + " - " + -y + "i");
	        else 
	        	System.out.println(x + " + " + y + "i");
    }
}
class FsComparator implements Comparator<Fs> {
    @Override
    public int compare(Plural o1, Plural o2) {
        return o1.getX() < o2.getX() ? 1 : -1;
    }
}
public class test {
    public static void main(String[] args) {
    	ArrayList<Plural> lst = new ArrayList<>();
        lst.add(new Fs(0, 2.3));
        lst.add(new Fs(-5, 4));
        lst.add(new Fs(-1.2, -3));
        lst.add(new Fs(1, 0));
        Collections.sort(lst, Collections.reverseOrder(new FsComparator()));
        for(Fs p : lst)
            p.show();
    }
}

常用类的基本操作

import java.util.ArrayList;
import java.util.Iterator;

public class test {
	public static void main(String[] args) {
		ArrayList<Integer> li = new ArrayList<Integer>();
		for( int i=0;i<10;i++ )
		li.add(i); 
		li.remove(1);
		li.remove((Integer)5);
		Iterator<Integer> it = li.iterator();
		while (it.hasNext()) {
			int n = it.next();
			System.out.print(n+" ");
		}
	}
}

import java.util.Iterator;
import java.util.LinkedList;

public class test {
	public static void main(String[] args) {
		String String = new String("AAA");
		String String2 = new String("BBB");
		String String3 = new String("CCC");

		LinkedList<String> li = new LinkedList<String>();
		li.add(String);
		li.add(String2);
		li.add(String3);
		li.remove(1);
		li.remove("CCC");
		Iterator<java.lang.String> it = li.iterator();
		while (it.hasNext()) {
			String n = (java.lang.String) it.next();
			System.out.println(n);
		}
	}
}
import java.util.HashSet;
import java.util.Iterator;

public class test {   
    public static void main(String[] args) {   
        HashSet<Character> set = new HashSet<Character>();
        set.add('a');   
        set.add('b');   
        set.add('c');   
        set.add('d');   
        set.add('e');   
        Iterator<Character> it = set.iterator();
        while (it.hasNext()) {
          char str = it.next();
          System.out.print(str+" ");
        }
        System.out.println();
        set.remove('c');
        for(char str : set) {
              System.out.print(str+" ");
        }
        System.out.println(set.size());
    }   
}
import java.util.Iterator;
import java.util.TreeSet;
 
public class test {
	public static void main(String[] args) {
		TreeSet<Pet>  t = new TreeSet<Pet>();
		Pet cat=new Pet("123",3);
		t.add(new Pet("456",2));
		t.add(new Pet("789",3));
		t.add((Pet)cat);
		Iterator<Pet> it = t.iterator();
		while(it.hasNext()){
			Pet pet = (Pet) it.next();
			System.out.println(pet.getAge()+"  "+ pet.getName());
		}
		System.out.println();
		t.pollLast();
		System.out.println(t.contains((Pet)cat));
		t.remove((Pet)cat);
		for(Pet stu: t) {
	        System.out.println(stu.getAge()+"  "+stu.getName());
	    }
	}
}