java作业第四周

【问题描述】 编辑MapTest类，掌握put等方法的使用，以及熟悉使用keySet方法结合foreach遍历Map对象中所有元素的key和value，使用entrySet方法、结合Iterator接口与Map.Entry接口遍历Map对象中所有元素的key和value，使用values方法结合foreach遍历所有的元素的value。

package DIGUI;

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: ice_water
 * @Date: 2022/03/26/12:07 AM
 */

public class demo19 {
  public static void main(String[] args) {

    Map players = new HashMap();
    players.put("30", "Curry");
    players.put("35", "Durant");
    //  加入一个key为11（String类型），value为Thompson（String类型）的元素
    players.put("11", "Thompson");

    //第一种：使用foreach二次取值
    //通过Map.keySet遍历key和value：
//    ==================================================
    for (Object key : players.keySet()) {
//    ==================================================

      String number = (String) key;

//    ==================================================
      String name = (String) players.get(key);
//    ==================================================

      System.out.println("key" + number + " and value= " + name);
    }

    //第二种
    //通过Map.entrySet使用iterator遍历key和value
    Set set  =  players.entrySet();

//    ==================================================
    Iterator<Map.Entry> it = players.entrySet().iterator();
//    ==================================================

    while (it.hasNext()) {

//    ==================================================
      Map.Entry<String, String> entry = it.next();
      String number = entry.getKey();
      String name = entry.getValue();
//    ==================================================

      System.out.println("key=  "+  number  +  "  and  value=  "  +  name);
    }

    //第三种
    //使用values方法遍历输出所有value
    for (Object value : players.values()) {
      String  name  =  (String)  value;
      System.out.println("value=  "  +  name);
    }
  }
}

综上选D，可以参考我的老文章 文章链接

完善并运行程序，使其能够按照字符串的长度升序排序。

import java.util.Comparator;

import java.util.TreeSet;

class MyComparator implements Comparator {

public int compare(Object obj1, Object obj2) {

//在此补充代码

}

}

public class ComparatorDemo {

public static void main(String[] args) {

TreeSet ts = new TreeSet(new MyComparator());

ts.add(“Jack”);

ts.add(“Helena”);

ts.add(“Eve”);

System.out.println(ts);

}

}

package DIGUI;

import java.util.Comparator;
import java.util.TreeSet;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: ice_water
 * @Date: 2022/03/22/5:15 PM
 */

class MyComparator implements Comparator<String> {

  public int compare(String obj1, String obj2) {
    
//    ==================================================
    return obj1.length() - obj2.length();
//    ==================================================
  }
}

public class ComparatorDemo {

  public static void main(String[] args) {

    TreeSet ts = new TreeSet(new MyComparator());

    ts.add("Jack");

    ts.add("Helena");

    ts.add("Eve");

    System.out.println(ts);


  }

}

【问题描述】编程实现如下功能：删掉13、57、68、34、57、13、78、45这几个整数中的多余重复数据，然后以一列的方式由小到大输出

import java.util.TreeSet;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: ice_water
 * @Date: 2022/03/26/12:56 AM
 */

public class demo20 {
  public static void main(String[] args) {
    TreeSet<Integer> set = new TreeSet();
    set.add(13);
    set.add(57);
    set.add(68);
    set.add(34);
    set.add(57);
    set.add(13);
    set.add(78);
    set.add(45);

    for (Integer value : set) {
      System.out.println(value);
    }
  }
}

【问题描述】

编程实现如下功能：将"Tom"、“Mary”、“Jack”、"Rose"依次添加到ArrayList集合中，然后利用相关语句将这些名字以一列的形式输出到屏幕上。

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: ice_water
 * @Date: 2022/03/26/1:06 AM
 */

public class demo21 {
  public static void main(String[] args) {
    ArrayList<String> list = new ArrayList();
    list.add("Tom");
    list.add("Mary");
    list.add("Jack");
    list.add("Rose");

    for (String value : list) {
      System.out.println(value);
    }
  }
}

【问题描述】

完善并运行如下程序，使其能够按如下规则排序：先按age升序排，当age相同时，再按name升序排。

import java.util.TreeSet;

class Teacher implements Comparable {

String name;

int age;

public Teacher(String name, int age) {

	this.name = name;

	this.age = age;

}

public String toString() {	        

	return name + ":" + age;

}

//在此处补充排序依据代码

}

public class SortTeacher {

public static void main(String[] args) {

	TreeSet ts = new TreeSet();               

	ts.add(new Teacher("Jack",19));           

	ts.add(new Teacher("Rose",18));

	ts.add(new Teacher("Tom", 19));

	ts.add(new Teacher("Rose",18));

	System.out.println(ts);

}

}

import java.util.TreeSet;

/**
 * Created with IntelliJ IDEA.
 *
 * @Author: ice_water
 * @Date: 2022/03/22/5:07 PM
 */

class Teacher implements Comparable<Teacher> {
  String name;
  int age;

  public String getName() {
    return name;
  }

  public void setName(String name) {
    this.name = name;
  }

  public int getAge() {
    return age;
  }

  public void setAge(int age) {
    this.age = age;
  }

  public Teacher(String name, int age) {
    this.name = name;
    this.age = age;
  }

  public String toString() {
    return name + ":" + age;
  }


  public int compareTo(Teacher teacher) {
    if (this.getAge() - (teacher.getAge()) != 0) {
      return this.getAge() - (teacher.getAge());
    } else {
      return this.getName().compareTo(teacher.getName());
    }
  }
}

public class SortTeacher {

  public static void main(String[] args) {

    TreeSet ts = new TreeSet();

    ts.add(new Teacher("Jack", 19));

    ts.add(new Teacher("Rose", 18));

    ts.add(new Teacher("Tom", 19));

    ts.add(new Teacher("Rose", 18));

    System.out.println(ts);

  }

}

学长生活不易，给个赞吧。