集合框架(Set&&堆栈案例)

এ 清ོ眸ꦿ℘゜

已于 2022-05-18 17:07:23 修改

阅读量162

点赞数

分类专栏： Set集合堆栈文章标签： java

于 2022-05-18 17:06:47 首次发布

本文链接：https://blog.csdn.net/qq_63845026/article/details/124845117

版权

Set集合同时被 2 个专栏收录

1 篇文章 0 订阅

订阅专栏

堆栈

1 篇文章 0 订阅

订阅专栏

package com.zking.collection;

import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Demo01 {
	public static void main(String[] args) {
		//Set集合的特点 1.无序
		Set set = new HashSet();
		
		set.add("a");
		set.add("b");
		set.add("c");
		set.add("d");
		//遍历方式只有两种 1.foreach
		for (Object object : set) {
			System.out.println(object);
		}
		System.out.println("--------------");
		//2.迭代器
		Iterator it = set.iterator();
		while(it.hasNext()) {
			Object next = it.next();
			System.out.println(next);
		}
		System.out.println("---------------");
		//Set集合的特点 2.元素不能重复
		set.add("a");
		
		for (Object object : set) {
			System.out.println(object);
		}
	}
}

TreeSet：根据某种(规则)对里面的元素进行排序

package com.zking.collection;

import java.util.Set;
import java.util.TreeSet;

public class Demo02 {

	public static void main(String[] args) {
		Set<String> set = new TreeSet<String>();
		//根据某种(规则)对里面的元素进行排序
		set.add("a");
		set.add("z");
		set.add("f");
		set.add("b");
		set.add("d");
		
		for (String string : set) {
			System.out.println(string);
		}
		
		
	}

}

自然比较接口: java.lang.Comparable

package com.zking.collection;

import java.io.Serializable;

public class User implements Serializable,Comparable<User>{

	/**
	 * 
	 */
	private static final long serialVersionUID = 2077569180889064728L;
	
	private Integer id;
	private String name;
	private String sex;
	public Integer getId() {
		return id;
	}
	public void setId(Integer id) {
		this.id = id;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getSex() {
		return sex;
	}
	public void setSex(String sex) {
		this.sex = sex;
	}
	public User() {
		// TODO Auto-generated constructor stub
	}
	public User(Integer id, String name, String sex) {
		this.id = id;
		this.name = name;
		this.sex = sex;
	}
	@Override
	public String toString() {
		return "User [id=" + id + ", name=" + name + ", sex=" + sex + "]";
	}
	@Override
	public int compareTo(User o) {
		//int i =this.getId()-o.getId();//顺序
		//int i =o.getId()-this.getId();倒序
		//i有三种结果   大于0顺序,小于0倒序,等于0不会添加
		int i = this.getName().hashCode()-o.getName().hashCode();
		return i;
	}
	
}

测试类:

package com.zking.collection;

import java.util.Set;
import java.util.TreeSet;

public class Demo03 {
	public static void main(String[] args) {
		Set<User> set = new TreeSet<User>();
		//根据某种(规则)对里面的元素进行排序
		set.add(new User(1, "a", "男"));
		set.add(new User(3, "z", "男"));
		set.add(new User(2, "f", "女"));
		set.add(new User(4,"a","女"));
		
		for (User user : set) {
			System.out.println(user);
		}
	}
}

比较器: java.util.Comparator

package com.zking.collection;

import java.io.Serializable;

public class User implements Serializable{

	/**
	 * 
	 */
	private static final long serialVersionUID = 2077569180889064728L;
	
	private Integer id;
	private String name;
	private String sex;
	public Integer getId() {
		return id;
	}
	public void setId(Integer id) {
		this.id = id;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getSex() {
		return sex;
	}
	public void setSex(String sex) {
		this.sex = sex;
	}
	public User() {
		// TODO Auto-generated constructor stub
	}
	public User(Integer id, String name, String sex) {
		this.id = id;
		this.name = name;
		this.sex = sex;
	}
	@Override
	public String toString() {
		return "User [id=" + id + ", name=" + name + ", sex=" + sex + "]";
	}
//	@Override
//	public int compareTo(User o) {
//		//int i =this.getId()-o.getId();//顺序
//		//int i =o.getId()-this.getId();倒序
//		//i有三种结果   大于0顺序,小于0倒序,等于0不会添加
//		int i = this.getName().hashCode()-o.getName().hashCode();
//		return i;
//	}
	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + ((id == null) ? 0 : id.hashCode());
		result = prime * result + ((name == null) ? 0 : name.hashCode());
		result = prime * result + ((sex == null) ? 0 : sex.hashCode());
		return result;
	}
	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		User other = (User) obj;
		if (id == null) {
			if (other.id != null)
				return false;
		} else if (!id.equals(other.id))
			return false;
		if (name == null) {
			if (other.name != null)
				return false;
		} else if (!name.equals(other.name))
			return false;
		if (sex == null) {
			if (other.sex != null)
				return false;
		} else if (!sex.equals(other.sex))
			return false;
		return true;
	}
	
}

package com.zking.collection;

import java.util.Comparator;

public class NameComparator implements Comparator<User>{

	@Override
	public int compare(User o1, User o2) {
		if(o1.getName().hashCode()-o2.getName().hashCode()>0) {
			return 10;
		}else if(o1.getName().hashCode()-o2.getName().hashCode()<0){
			return -1;
		}else {
			return 1;
		}
	}

}

package com.zking.collection;

import java.util.Set;
import java.util.TreeSet;

public class Demo03 {
	public static void main(String[] args) {
		Set<User> set = new TreeSet<User>(new NameComparator());
		//根据某种(规则)对里面的元素进行排序
		set.add(new User(1, "a", "男"));
		set.add(new User(3, "z", "男"));
		set.add(new User(2, "f", "女"));
		set.add(new User(7,"a","女"));
		
		for (User user : set) {
			System.out.println(user);
		}
	}
}

如果比较器NameComparator else里返回的是零，就不会添加，id=7的那一列就没有

二: LinkedHashSet的特点

1)元素是有顺序的
2)元素是不重复的
3)底层数据结构是按照链表的结构存储的 Linked

三：案例：堆栈：表示一个先进后出的数据结构

package com.zking.dog;

import java.util.LinkedList;

public class MyStack {
	public LinkedList list = new LinkedList();
	
	/**
	 * 压栈   装子弹
	 * @param obj
	 */
	public void push(Object obj) {
		list.addFirst(obj);
	}
	
	/**
	 * 出栈  开枪
	 * @return
	 */
	public Object pop() {
		Object pop = list.pop();
		return pop;
	}
	
	/**
	 * 堆栈的元素个数
	 * @return
	 */
	public int getSize() {
		return list.size();
	}
	
	public static void main(String[] args) {
		MyStack ms = new MyStack();
				
		ms.push("aa");
		ms.push("bb");
		ms.push("cc");
		while(ms.getSize()!=0) {
			Object ob=ms.pop();
			System.out.println(ob);
		}
		
		
	
	}
}

好了，我的分享到此结束，希望能帮到大家！！！

এ 清ོ眸ꦿ℘゜

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
集合框架(Set&&堆栈案例)

目录一：Set特点、遍历方式、以及常用实现类二: LinkedHashSet的特点三:案例一：Set1. Set 1.1 特点：无序、对象不能重复 1.2 遍历 1.2.1 foreach 1.2.2 迭代器 1.3 常用实现类 HashSet TreeSet：根据某种(规则)对里面的元素进行排序自然比较接口: java.lang.Comparable 比较器: java.util.Compa...
复制链接

扫一扫