大数据学——javaEE

在这里插入图片描述

用户代码块

package product;

public class User {
	private String id;
	private String name;
	private String password;
	private String phone;
	private int age;
	private float salary;
	public String getId() {
		return id;
	}
	public void setId(String id) {
		this.id = id;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getPassword() {
		return password;
	}
	public void setPassword(String password) {
		this.password = password;
	}
	public String getPhone() {
		return phone;
	}
	public void setPhone(String phone) {
		this.phone = phone;
	}
	public int getAge() {
		return age;
	}
	public void setAge(int age) {
		this.age = age;
	}
	public float getSalary() {
		return salary;
	}
	public void setSalary(float salary) {
		this.salary = salary;
	}
	public User(String id, String name, String password, String phone, int age, float salary) {
	
		this.id = id;
		this.name = name;
		this.password = password;
		this.phone = phone;
		this.age = age;
		this.salary = salary;
	}
	@Override
	public String toString() {
		return "User [id=" + id + ", name=" + name + ", password=" + password + ", phone=" + phone + ", age=" + age
				+ ", salary=" + salary + "]";
	}
	
	

}

用户测试代码块

package product;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Set;

public class UserTset {
	public static void main(String[] args) {
		User u1 = new User("1", "张三1", "111", "1368882", 23, 2899);
		User u2 = new User("2", "张三2", "111", "1368882", 23, 2899);
		User u3 = new User("3", "张三3", "111", "1368882", 50, 2899);
		User u4 = new User("4", "张三4", "111", "1368882", 23, 2899);

		// 放入数组
		User[] userArr = new User[] { u1, u2, u3, u4 };

		// 放入集合
		ArrayList<User> userList = new ArrayList<User>();

		userList.add(u1);
		userList.add(u2);
		userList.add(u3);
		userList.add(u4);

		// 放入set
		HashSet<User> hashSet = new HashSet<User>();
		hashSet.add(u1);
		hashSet.add(u2);
		hashSet.add(u3);
		hashSet.add(u4);

		// 放入map
		HashMap<String, User> hashMap = new HashMap<String, User>();
		hashMap.put(u1.getId(), u1);
		hashMap.put(u2.getId(), u2);
		hashMap.put(u3.getId(), u3);
		hashMap.put(u4.getId(), u4);

		// 遍历数组
		for (User u : userArr) {
			System.out.println(u);
		}
		System.out.println("---------------");

		// 遍历集合
		for (User u : userList) {
			System.out.println(u);
		}
		System.out.println("------------------");

		// 遍历set
		for (User u : hashSet) {
			System.out.println(u);
		}
		System.out.println("--------------");

		// 遍历map
		Set<String> keySet = hashMap.keySet();
		for (String id : keySet) {
			User user = hashMap.get(id);
			System.out.println(user);
		}
		System.out.println("---------------");

		// 遍历map的另一种方法
		Set<Entry<String, User>> entrySet = hashMap.entrySet();
		for (Entry<String, User> user : entrySet) {
			System.out.println(user);
		}
		System.out.println("------------------");

		// 从list中找出年龄最大的user
		User u = userList.get(0);
		for (int i = 1; i < userList.size(); i++) {
			if (userList.get(i).getAge() > u.getAge()) {
				u = userList.get(i);
			}
		}
		System.out.println("年龄最大的为" + u);

		System.out.println("-----------------");

		// 从set中找出薪水最高的user对象
		Iterator<User> iterator = hashSet.iterator();
		User u_set = iterator.next();
		for(User u11 : hashSet) {
			if(u11.getSalary() > u_set.getSalary()) {
				u_set = u11;
				
			}
		}
		System.out.println("薪水最高的用户为:"+u_set);
		
		//从map中取出年龄最小的user用户
		Set<String> keySet2 = hashMap.keySet();
		
		Iterator<String> iterator2 = keySet2.iterator();
		String id = iterator2.next();
		
		User u_map = hashMap.get(id);
		for(String key : keySet2) {
			if(hashMap.get(key).getAge() < u_map.getAge()) {
				u_map = hashMap.get(key);
			}
		}
		System.out.println("年龄最小的用户为:" + u_map);
		
		
		
		
		
		

	}

}

商品代码块

package product;

public class Product {
	private String pId;
	private String pName;
	private float pPrice;
	private int num;
	public String getpId() {
		return pId;
	}
	public void setpId(String pId) {
		this.pId = pId;
	}
	public String getpName() {
		return pName;
	}
	public void setpName(String pName) {
		this.pName = pName;
	}
	public float getpPrice() {
		return pPrice;
	}
	public void setpPrice(float pPrice) {
		this.pPrice = pPrice;
	}
	public int getNum() {
		return num;
	}
	public void setNum(int num) {
		this.num = num;
	}
	
	//含参构造
	public Product(String pId, String pName, float pPrice, int num) {
		
		this.pId = pId;
		this.pName = pName;
		this.pPrice = pPrice;
		this.num = num;
	}
	
	

}

商品测试代码块

package product;

import java.util.ArrayList;
import java.util.HashMap;





public class Product_test {
	public static void main(String[] args) {
		// 列出商品
		Product p1 = new Product("1", "正常咖啡", 98.8f, 1);
		Product p2 = new Product("2", "雪中咖啡", 90.8f, 1);
		Product p3 = new Product("3", "猫屎咖啡", 91.8f, 1);
		Product p4 = new Product("4", "香粉咖啡", 92.8f, 1);
		Product p5 = new Product("5", "雀巢咖啡", 23.8f, 1);
		
		User u1 = new User("1", "张三1", "111", "1368882", 23, 2899);
		User u2 = new User("2", "张三2", "111", "1368882", 21, 2900);
		User u3 = new User("3", "张三3", "111", "1368882", 26, 3212);

		// 购物车,用hashmap来传入
		// 用户购买的上品用集合来封装
		HashMap<String, ArrayList<Product>> carmap = new HashMap<>();
		Product p11 = new Product("1", "正常咖啡", 98.8f, 2);
		Product p13 = new Product("3", "猫屎咖啡", 91.8f, 4);
		Product p15 = new Product("5", "雀巢咖啡", 23.8f, 1);
		
		ArrayList<Product> zs_pdts = new ArrayList<Product>();
		zs_pdts.add(p11);
		zs_pdts.add(p13);
		zs_pdts.add(p15);
		
		carmap.put(u3.getName(), zs_pdts);
		
		Product p22 = new Product("2","雪中咖啡",90.8f,1);
		Product p23 = new Product("3","猫屎咖啡",91.8f,2);
		Product p24 = new Product("4","香粉咖啡",92.8f,1);
		
		ArrayList<Product> ls_pdts = new ArrayList<Product>();
		ls_pdts.add(p22);
		ls_pdts.add(p23);
		ls_pdts.add(p24);
		carmap.put(u1.getName(),ls_pdts);

	}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值