import java.util.*; // 创建人类并重写equals和hashcode方便比较人类值 class People{ int height; int weight; int age; // 重写equals和hashcode方便比较人类值 @Override public boolean equals(Object o) { if (this == o) return true; if (o == null || getClass() != o.getClass()) return false; People people = (People) o; return height == people.height && weight == people.weight && age == people.age; } @Override public int hashCode() { return Objects.hash(height, weight, age); } // 全参构造器 public People(int height, int weight, int age) { this.height = height; this.weight = weight; this.age = age; } } public class LANQIAO { // 设定set用来装入全市人民 public static Set<People> set = new HashSet<>(); public static void main(String[] args) { Scanner sc= new Scanner(System.in); // n个市民 m个嫌犯 int n = sc.nextInt(); int m = sc.nextInt(); int x,y,z; for (int i = 0; i < n; i++) { x = sc.nextInt(); y = sc.nextInt(); z = sc.nextInt(); // 加入新市民 set.add(new People(x,y,z)); } // 人类数组存嫌犯 People[] p = new People[m]; for (int i = 0; i < m; i++) { x = sc.nextInt(); y = sc.nextInt(); z = sc.nextInt(); p[i] = new People(x,y,z); } // 询问set集合里是否有该嫌犯 for (int i = 0; i < p.length; i++) { if(set.contains(p[i])){ System.out.println("yes"); }else System.out.println("no"); } } }
蓝桥杯真题-盗窃案
最新推荐文章于 2024-08-22 20:46:17 发布