李兴华java开发实战经典-类集合

1.list和Collection集合
public class MyList {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		alllist.add("hello");
		alllist.add(0,"World");
		System.out.println(alllist);
		
		Collection <String> allCollection=null;
		allCollection=new ArrayList<String>();
		allCollection.add("zhangsan");
		allCollection.add("beijing");
		alllist.addAll(allCollection);
		System.out.println(alllist);
	}
}
2.list添加删除元素
public class MyList {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		alllist.add("hello");
		alllist.add(0,"World");
		alllist.add("zhangsan");
		alllist.add("beijing");
		alllist.add("zhangsan");
		System.out.println(alllist);
		
		alllist.remove(0);
		System.out.println(alllist);
		
		alllist.remove("hello");
		System.out.println(alllist);
	}
}
3.list集合到数组方法
public class MyList {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		alllist.add("hello");
		alllist.add(0,"World");
		alllist.add("zhangsan");
		alllist.add("zhangsan");
		alllist.add("beijing");
		String str[]=alllist.toArray(new String[] {});
		for (String string : str) {
			System.out.println(string+"\t");
		}
	}
}
4.Arraylist的一些乱七八糟的方法
public class MyList {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		alllist.add("hello");
		alllist.add(0,"World");
		alllist.add("zhangsan");
		alllist.add("zhangsan");
		alllist.add("beijing");
		System.out.println(alllist.isEmpty());
		System.out.println(alllist.contains("zhangsan"));
		String str[]=alllist.toArray(new String[] {});
		for (String string : str) {
			System.out.println(string+"\t");
		}
		
		System.out.println("===============");
		List<String> list2=alllist.subList(1, 3);
		String str2[] =list2.toArray(new String[] {});
		for (String string : str2) {
			System.out.println(string);
		}
	}
}
4.LinkedList的一些乱七八糟的方法
public class MyList {

	public static void main(String[] args) {
		LinkedList<String> link=new LinkedList<String>();
		link.add("ncepu");
		link.add("tingshua");
		link.add("pingjingu");
		link.add("nanchangu");
		System.out.println("初始化链表"+link);
		link.addFirst("centerminzu");
		link.addLast("peijingnormalu");
		System.out.println("增加后链表"+link);
		System.out.println("表的第一个元素(表头):"+link.element());	
		System.out.println(link);
		System.out.println("表的第一个元素(表头):"+link.peek());
		System.out.println(link);
		System.out.println("表的第一个元素(表头):"+link.poll());//这种方式找到表头后,表头就不见了
		System.out.println(link);
		System.out.println("===================");
		System.out.println("以FIFO(现金先出)的方式输出");
		for (int i = 0; i < link.size()+1; i++) {
			System.out.println(link.poll()+"、");
		}
	}
}
4.set及TreeSet
public class MyList {
	public static void main(String[] args) {
		Set<String> allSet=new HashSet<String>();
		allSet.add("zhangsan");
		allSet.add("lisi");
		allSet.add("wanger");
		System.out.println(allSet);
		//Set不可以重复
		allSet.add("lisi");
		System.out.println(allSet);

	}
}

TreeSet

public class MyList {

	public static void main(String[] args) {
		Set<String> allSet=new TreeSet<String>();
		allSet.add("zhangsan");
		allSet.add("lisi");
		allSet.add("wanger");
		allSet.add("lisi");
		allSet.add("zhangsan");
		System.out.println(allSet);
		
		allSet.add("lisi");
		allSet.add("wanger");
		//Set不可以重复,TreeSet可以自动排序
		System.out.println(allSet);

	}
}
5.set中的对象排序
class Person implements Comparable<Person>{
	String name;
	int age;
	public Person(String name,int age) {
		this.name=name;
		this.age=age;
	}
	
	public String toString() {
		return "姓名:"+this.name+" age"+this.age;
	}

	@Override
	public int compareTo(Person per) {
		if (this.age>per.age) {
			return 1;
		}else if (this.age<per.age) {
			return -1;

		}else {
			return this.name.compareTo(per.name);//在年龄一致的情况下再对姓名进行排序

		}
		
	}
}

public class MyList {

	public static void main(String[] args) {
		Set<Person> allSet=new TreeSet<Person>();
		allSet.add(new Person("张三", 30));
		allSet.add(new Person("张三", 30));
		allSet.add(new Person("李四", 34));
		allSet.add(new Person("王五", 32));
		allSet.add(new Person("赵六", 23));
		allSet.add(new Person("孙七", 23));
		System.out.println(allSet);//同时实现了自定义排序
		
	}
}
6.set中去除相同元素(通过hashcode和equals)
class Person {
	String name;
	int age;
	public Person(String name,int age) {
		this.name=name;
		this.age=age;
	}
	public boolean equals(Object obj) {//复写equals,完成对象比较
		if (this==obj) {
			return true;
		}
		if (!(obj instanceof Person)) {
			return false;
		}
		
		Person person=(Person)obj;
		if (this.name.equals(person.name)&&this.age==person.age) {
			return true;
		}else {
			return false;
		}
		
	}
	public int hashCode() {
		
		return this.name.hashCode()*this.age;//自定义hashCode的返回
	}
	
	public String toString() {
		return "姓名:"+this.name+" age"+this.age;
	}
}

public class MyList {

	public static void main(String[] args) {
		Set<Person> allSet=new HashSet<Person>();
		allSet.add(new Person("张三", 30));
		allSet.add(new Person("张三", 30));
		allSet.add(new Person("张三", 20));
		allSet.add(new Person("李四", 34));
		allSet.add(new Person("王五", 32));
		allSet.add(new Person("赵六", 23));
		allSet.add(new Person("孙七", 23));
		System.out.println(allSet);//同时实现了自定义排序
		
	}
}
7.sortSet可排序的集合
public class MyList {

	public static void main(String[] args) {
		SortedSet<String> allset=new TreeSet<String>();//使用TreeSet实例化
		allset.add("A");
		allset.add("A");
		allset.add("B");
		allset.add("C");
		allset.add("C");
		allset.add("D");
		allset.add("D");
		allset.add("E");
		System.out.println("第一个元素"+allset.first());
		System.out.println("最后一个元素"+allset.last());
		System.out.println("headSet个元素"+allset.headSet("C"));
		System.out.println("headSet个元素"+allset.tailSet("C"));
		System.out.println("subSet个元素"+allset.subSet("B","D"));
		
	}
}
8.Iterator接口–使用Iterator遍历list集合元素
public class IteratorDemo {
	public static void main(String[] args) {

		List <String> all=new ArrayList<String>();
		all.add("hello");
		all.add("_");
		all.add("world");
		
		Iterator<String> iter=all.iterator();
		while (iter.hasNext()) {
			String string=iter.next();
			if ("_".equals(string)) {
				iter.remove();//删除元素
			}
		}
		System.out.println("删除非法字符后的集合:"+all);	

	}

}
9.Iterator接口–使用Enumeration遍历Vector集合元素
public class IteratorDemo {

	public static void main(String[] args) {
		Vector<String > vetor=new Vector<String>();
		
		vetor.add("hello");
		vetor.add("_");
		vetor.add("world");
		
		Enumeration<String> myenum=vetor.elements();
		while (myenum.hasMoreElements()) {
			String string = (String) myenum.nextElement();
			System.out.print(string+"、");
		}
		
	}

}
10.Map接口
public class IteratorDemo {

	public static void main(String[] args) {
		Map<String,String> map=new HashMap<String, String>();
		map.put("pku", "www.beijingUniversity");
		map.put("tingshua", "qinghuaUniversity");
		map.put("normal","normalUniversity");
		
		String string=map.get("tingshua");
		System.out.println(string);
		
	}

}
public class IteratorDemo {

	public static void main(String[] args) {
		Map<String,String> map=new HashMap<String, String>();
		map.put("pku", "www.beijingUniversity");
		map.put("tingshua", "qinghuaUniversity");
		map.put("normal","normalUniversity");
		
		String string=map.get("tingshua");
		System.out.println(string);
		if (map.containsKey("normal")) {
			System.out.println(map.get("normal"));			
		}
		if (map.containsValue(string)) {
			System.out.println(string);
		}
		
		Set <String> keys=map.keySet();
		for (String string2 : keys) {
			System.out.println(string2);
		}
		Iterator<String> iterator=keys.iterator();
		while (iterator.hasNext()) {
			System.out.print(iterator.next()+"_");
			
		}
	}
}
11.Map接口–TreeMap
public class IteratorDemo {

	public static void main(String[] args) {
		Map<String,String> map=new TreeMap<String, String>();
		map.put("A-pku", "www.beijingUniversity");
		map.put("C-tingshua", "qinghuaUniversity");
		map.put("B-normal","normalUniversity");
		
		Set<String> keys=map.keySet();
		Iterator<String> iter=keys.iterator();
		while(iter.hasNext()){
			String string=iter.next();
			System.out.println(string+"_"+map.get(string));//实现了排序
		}
	}

}
12.Map接口–MapEntry
class Person{
	String name;
	int age;
	public Person(String name,int age) {
		this.name=name;
		this.age=age;
		
	}
	
	public String toString(){
		return "同学:"+this.name+"年龄:"+this.age;
	}
	
	public boolean equals(Object obj) {
		if (this==obj) {
			return true;
		}
		if (!(obj instanceof Person)) {
			return false;
		}
		Person p=(Person)obj;
		if (this.name.equals(p.name) && this.age==p.age) {
			return  true;
		}else {
			return false;
		}
		
	}
	
	public int hashCode() {
		return this.name.hashCode()*this.age;
	}
}

public class IteratorDemo {

	public static void main(String[] args) {
		Map<Person,String> map=new HashMap<Person,String>();
		map.put(new Person("张三", 30),"zhangsan_1");
		map.put(new Person("张三", 30),"zhangsan_2");
		map.put(new Person("李四", 31),"lisi");
		
		Set<Map.Entry<Person, String>> allSet=map.entrySet();
		Iterator<Map.Entry<Person, String>> iterator=allSet.iterator();
		while (iterator.hasNext()) {
			Map.Entry<Person, String> me=iterator.next();
			System.out.println(me.getKey()+" -- "+me.getValue());	//相等的被过滤掉了
		}
		
	}

}

结果:
同学:张三年龄:30 – zhangsan_2
同学:李四年龄:31 – lisi

13.Map接口–对象作为键值
class Person{
	String name;
	int age;
	public Person(String name,int age) {
		this.name=name;
		this.age=age;
		
	}
	
	public String toString(){
		return "同学:"+this.name+"年龄:"+this.age;
	}
	
	public boolean equals(Object obj) {
		if (this==obj) {
			return true;
		}
		if (!(obj instanceof Person)) {
			return false;
		}
		Person p=(Person)obj;
		if (this.name.equals(p.name) && this.age==p.age) {
			return  true;
		}else {
			return false;
		}
		
	}
	
	public int hashCode() {
		return this.name.hashCode()*this.age;
	}
}

public class IteratorDemo {

	public static void main(String[] args) {
		Map<Person,String> map=new HashMap<Person,String>();
		
		map.put(new Person("张三",30), "张三");
		System.out.println(map.get(new Person("张三",30)));
		
	}

}
14.Map接口–IdentityHashMap
class Person{
	String name;
	int age;
	public Person(String name,int age) {
		this.name=name;
		this.age=age;
		
	}
	
	public String toString(){
		return "同学:"+this.name+"年龄:"+this.age;
	}
	
	public boolean equals(Object obj) {
		if (this==obj) {
			return true;
		}
		if (!(obj instanceof Person)) {
			return false;
		}
		Person p=(Person)obj;
		if (this.name.equals(p.name) && this.age==p.age) {
			return  true;
		}else {
			return false;
		}
		
	}
	
	public int hashCode() {
		return this.name.hashCode()*this.age;
	}
}

public class IteratorDemo {

	public static void main(String[] args) {
		Map<Person,String> map=new IdentityHashMap<Person,String>();
		map.put(new Person("张三", 30),"zhangsan_1");
		map.put(new Person("张三", 30),"zhangsan_2");
		map.put(new Person("李四", 31),"lisi");
		
		Set<Map.Entry<Person, String>> allSet=map.entrySet();
		Iterator<Map.Entry<Person, String>> iterator=allSet.iterator();
		while (iterator.hasNext()) {
			Map.Entry<Person, String> me=iterator.next();
			System.out.println(me.getKey()+" -- "+me.getValue());	//相同对象的key值保留
		}
		
	}

}

结果:
同学:张三年龄:30 – zhangsan_1
同学:张三年龄:30 – zhangsan_2
同学:李四年龄:31 – lisi

15.Map接口–SortedMap

TreeMap的是SortedMap的子类

public class SortMap {

	public static void main(String[] args) {
		SortedMap<String,String> map=new TreeMap<String, String>();
		map.put("D,jiangkeer","www.sian.com");
		map.put("A,xuexi","www.baidom");
		map.put("C,saonian","www.sohu.com");
		map.put("B,sechu","www.tomcom.com");
		System.out.println("第一个内容的key:"+map.firstKey()+" 值为:"+map.get(map.firstKey()));
		System.out.println("第一个内容的key:"+map.lastKey()+" 值为:"+map.get(map.lastKey()));
		System.out.println("返回小于指定范围的集合");
		for (Map.Entry<String,String> me : map.headMap("B,sechu").entrySet()) {
			System.out.println(me.getKey()+"  "+me.getValue());
		}
		System.out.println("返回大于指定范围的集合");
		for (Map.Entry<String,String> me : map.tailMap("B,sechu").entrySet()) {
			System.out.println(me.getKey()+"  "+me.getValue());
		}
		System.out.println("返回部分集合");
		for (Map.Entry<String,String> me : map.subMap("A,sechu","C,saonian").entrySet()) {
			System.out.println(me.getKey()+"  "+me.getValue());
		}
		
	}

}

结果:

第一个内容的key:A,xuexi 值为:www.baidom
第一个内容的key:D,jiangkeer 值为:www.sian.com
返回小于指定范围的集合
A,xuexi www.baidom
返回大于指定范围的集合
B,sechu www.tomcom.com
C,saonian www.sohu.com
D,jiangkeer www.sian.com
返回部分集合
A,xuexi www.baidom
B,sechu www.tomcom.com

15.Collections类
public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "www.sina.com", "www.baidu.com" ,"www.netease.com");
		Iterator<String> iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println(iterator.next()+"-");		
		}

	}

}

结果:
www.sina.com-
www.baidu.com-
www.netease.com-

16.Collections类–内容反转、检索、替换、排序、交换内容

反转

public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "www.sina.com", "www.baidu.com" ,"www.netease.com");
		Collections.reverse(alllist);
		Iterator<String> iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println(iterator.next()+"-");		
		}

	}

}

结果:
www.netease.com-
www.baidu.com-
www.sina.com-

检索

public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "www.sina.com", "www.baidu.com" ,"www.netease.com");
		int point=Collections.binarySearch(alllist, "www.netease.com");
		System.out.println("检索结果:"+point);
	}
}

结果:
检索结果:2

替换

public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "www.sina.com", "www.baidu.com" ,"www.netease.com");
		Iterator<String> iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("替换之前"+iterator.next());
			
		}
		System.out.println("---------------执行替换之后-----------------");

		//执行替换操作
		Collections.replaceAll(alllist, "www.baidu.com", "www.tencent.com");
		iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("替换之后"+iterator.next());
			
		}
	}

}

结果:
替换之前www.sina.com
替换之前www.baidu.com
替换之前www.netease.com
---------------执行替换之后-----------------
替换之后www.sina.com
替换之后www.tencent.com
替换之后www.netease.com

排序

public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "C:www.sina.com", "A:www.baidu.com" ,"B:www.netease.com");
		Iterator<String> iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("排序之前"+iterator.next());
			
		}
		System.out.println("---------------排序之后-----------------");

		//执行排序操作
		Collections.sort(alllist);
		iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("排序之后"+iterator.next());
			
		}
	}

}

结果:
排序之前C:www.sina.com
排序之前A:www.baidu.com
排序之前B:www.netease.com
---------------排序之后-----------------
替换之后A:www.baidu.com
替换之后B:www.netease.com
替换之后C:www.sina.com

交换内容

public class SortMap {

	public static void main(String[] args) {
		List<String> alllist=new ArrayList<String>();
		Collections.addAll(alllist, "C:www.sina.com", "A:www.baidu.com" ,"B:www.netease.com");
		Iterator<String> iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("交换之前"+iterator.next());
			
		}
		System.out.println("---------------排序之后-----------------");

		//执行排序操作
		Collections.swap(alllist, 0, 2);//将第一个和第三个元素交换
		iterator=alllist.iterator();
		while (iterator.hasNext()) {
			System.out.println("交换之后"+iterator.next());
			
		}
	}

}

结果:
交换之前C:www.sina.com
交换之前A:www.baidu.com
交换之前B:www.netease.com
---------------排序之后-----------------
交换之后B:www.netease.com
交换之后A:www.baidu.com
交换之后C:www.sina.com

17.stack(栈)类

栈是一个先进后出的数据存储方式

public class SortMap {

	public static void main(String[] args) {
		Stack<String> stack=new Stack<String>();
		stack.push("A");//入栈
		stack.push("B");
		stack.push("C");
		
		System.out.println(stack.pop()+" ");//正常出栈先进后出
		System.out.println(stack.pop()+" ");//正常出栈
		System.out.println(stack.pop()+" ");//正常出栈
		//System.out.println(stack.pop()+" ");//这个pop已经没有内存栈元素可以出了,会导致报错
	}

}

结果:
C
B
A

18.Properties)类–添加及读取属性、添加属性文件

添加及读取属性

public class SortMap {

	public static void main(String[] args) {
		Properties pro=new Properties();
		pro.setProperty("BJ", "beijing");
		pro.setProperty("TJ", "Tianjing");
		pro.setProperty("NJ", "Nanjing");
		
		System.out.println(pro.getProperty("BJ"));
		System.out.println(pro.get("TJ"));//其实get也是可以的
		System.out.println(pro.getProperty("SC","没有发现特定值"));//设定第二个参数作为默认值
		
	}

}

结果
beijing
Tianjing
没有发现特定值

添加属性到属性文件

public class SortMap {

	public static void main(String[] args) {
		Properties pro=new Properties();
		pro.setProperty("BJ", "beijing");
		pro.setProperty("TJ", "Tianjing");
		pro.setProperty("NJ", "Nanjing");
		
		File file=new File("D:"+File.separator+"area.properties");//指定要操作的文件	,也可以设置为.xml文件后缀	
		try {
			pro.store(new FileOutputStream(file), "Area info");//保存属性到普通文件
		} catch (Exception e) {
			// TODO: handle exception
		}

	}

}

生成的area.propertie文件内容为:
#Area info
#Mon Mar 02 23:34:46 CST 2020
TJ=Tianjing
BJ=beijing
NJ=Nanjing

读取属性文件

public class SortMap {

	public static void main(String[] args) {
		Properties pro=new Properties();
			
		File file=new File("D:"+File.separator+"area.properties");//指定要操作的文件		
		try {
			pro.load(new FileInputStream(file));//保存属性到普通文件
		} catch (Exception e) {
			// TODO: handle exception
		}
		
		System.out.println("读取BJ属性:"+pro.getProperty("BJ"));
	}
}

结果:
读取BJ属性:beijing

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值