Java 集合之 Set_setvere-优快云博客

本文链接：https://blog.youkuaiyun.com/verejava/article/details/80590028

本文介绍了一个使用Java集合框架的具体示例，通过HashSet和TreeSet对比展示了如何存储自定义对象，并实现了Comparable接口以便对对象进行排序。示例中使用了Ticket类来演示不同价格的票务信息如何被正确地存储和迭代。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://www.verejava.com/?id=1699456395143

package com.set;

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

public class TestHashSet
{
	public static void main(String[] args)
	{
		
		//Set set=new TreeSet();
                Set set=new HashSet();
		set.add(new Ticket("a",300));
		set.add(new Ticket("a",100));
		set.add(new Ticket("a",200));
		set.add(new Ticket("a",200));
		
		Iterator iter=set.iterator();
		while(iter.hasNext())
		{
			Object obj=iter.next();
			System.out.print(obj+",");
		}
		System.out.println("");
		Object[] objs=set.toArray();
		for(int i=0;i<objs.length;i++)
		{
			Object obj=objs[i];
			System.out.print(obj+",");
		}
	}
}





package com.set;

public class Ticket implements Comparable
{
	private String name;
	private double price;
	public Ticket(String name, double price)
	{
		super();
		this.name = name;
		this.price = price;
	}
	public String getName()
	{
		return name;
	}
	public void setName(String name)
	{
		this.name = name;
	}
	public double getPrice()
	{
		return price;
	}
	public void setPrice(double price)
	{
		this.price = price;
	}
	
	public String toString()
	{
		return name+","+price;
	}
	

	
	@Override
	public int compareTo(Object o)
	{
		Ticket t=(Ticket)o;
		if(price>t.getPrice())
		{
			return 1;
		}else if(price<t.getPrice())
		{
			return -1;
		}
		return 0;
	}
	
	
}

http://www.verejava.com/?id=1699456395143