1、集合框架Map介绍
Map简介:Map是STL的一个关联容器,它提供一对一(其中第一个可以称为关键字,每个关键字只能在map中出现一次,第二个可能称为该关键字的值)的数据处理能力,由于这个特性,它完成有可能在我们处理一对一数据的时候,在编程上提供快速通道。
常用方法(put,entrySet,keySet)
1.1:put
package com.lixiang.Map;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
public class MapDemo {
public static void main(String[] args) {
Map<Object, Object> map = new HashMap<>();
map.put("zs", 12);
map.put("ww", 23);
map.put("ls", 33);
map.put("zl", 22);
map.put("tq", 42);
map.put("mazi", 62);
Object old = map.put("zl", 23);
System.out.println("原来的值:"+old);
System.out.println(map);
运行后的结果为:
修改的用途(当容器中已经存在了的key,再次存放,那么会覆盖原有的key所对应的值value)调用此方法,可以获取原来的key对应的值
1.2:entrySet
package com.lixiang.Map;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
public class MapDemo {
public static void main(String[] args) {
Map<Object, Object> map = new HashMap<>();
map.put("zs", 12);
map.put("ww", 23);
map.put("ls", 33);
map.put("zl", 22);
map.put("tq", 42);
map.put("mazi", 62);
// Object old = map.put("zl", 23);
// System.out.println("原来的值:"+old);
// System.out.println(map);
Set<Entry<Object, Object>> entrySet = map.entrySet();
for (Entry<Object, Object> entry : entrySet) {
System.out.println("key:"+entry.getKey() + ",value:"+entry.getValue());
}
输出后的结果:
1.3:keySet
package com.lixiang.Map;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
public class MapDemo {
public static void main(String[] args) {
Map<Object, Object> map = new HashMap<>();
map.put("zs", 12);
map.put("ww", 23);
map.put("ls", 33);
map.put("zl", 22);
map.put("tq", 42);
map.put("mazi", 62);
// Object old = map.put("zl", 23);
// System.out.println("原来的值:"+old);
// System.out.println(map);
// Set<Entry<Object, Object>> entrySet = map.entrySet();
// for (Entry<Object, Object> entry : entrySet) {
// System.out.println("key:"+entry.getKey() + ",value:"+entry.getValue());
// }
//
Set<Object> keySet = map.keySet();
for (Object key : keySet) {
System.out.println("key:"+key + ",value:"+map.get(key));
}
}
}
输出的结果:
这两个方法是map集合中所特有的遍历方法
HashMap是无序的,集合的底层是set集合做的
HashMap 数据结构 哈希表
TreeMap 数据结构 二叉树
能够进行自然排序以及比较器排序
2、集合框架Map应用
- 1、将学生作为键,地址作为值进行存储,名字年龄相同则被认定为一个人,最后输出
思路:
a、封装学生类
b、判重(hashCode/equals)
c、打印
2、最后按年龄进行排序
a、需要让学生类自身具备比较性,实现Comparable接口
3、需求改变、按姓名进行排序
改变的代码是不可取的,我们需要新增个比较器来完成需求
实现java.util.comparator
package com.lixiang.Map;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Set;
import java.util.TreeMap;
public class HashMapDemo {
public static void main(String[] args) {
HashMap map = new HashMap<>();
map.put(new Student("zs", 25), "1");
map.put(new Student("ls", 35), "2");
map.put(new Student("ww", 28), "3");
map.put(new Student("zl", 25), "4");
map.put(new Student("ls", 25), "5");
map.put(new Student("ls", 25), "5");
Set keySet = map.keySet();
for (Object key : keySet) {
System.out.println(key);
}
}
}
class Student implements Comparable<Student>{
private String name;
private int age;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
@Override
public String toString() {
return "Student [name=" + name + ", age=" + age + "]";
}
public Student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public Student() {
super();
}
@Override
public int hashCode() {
return this.name.hashCode() + this.age;
}
@Override
public boolean equals(Object obj) {
Student stu = (Student) obj;
return this.name.equals(stu.name) && this.age == stu.age;
}
@Override
public int compareTo(Student o) {
int num = this.age - o.age;
if(num == 0) {
this.name.compareTo(o.name);
}
return num;
}
}
结果为:
按照年龄排序:
package com.lixiang.Map;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Set;
import java.util.TreeMap;
public class HashMapDemo {
public static void main(String[] args) {
TreeMap map=new TreeMap<>();
map.put(new student("zzz",13), "1");
map.put(new student("lll",18), "2");
map.put(new student("yyy",38), "3");
map.put(new student("www",24), "4");
map.put(new student("qqq",15), "5");
map.put(new student("eee",20), "6");
map.put(new student("rrr",50), "7");
Set keySet = map.keySet();
for (Object object : keySet) {
System.out.println(object);
}
}
}
class student implements Comparable<student>{
private String name;
private int age;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public student() {
super();
}
@Override
public String toString() {
return "student [name=" + name + ", age=" + age + "]";
}
@Override
public int hashCode() {
return this.name.hashCode()+this.age;
}
@Override
public boolean equals(Object obj) {
student stu=(student) obj;
return this.name.equals(stu.name) && this.age ==stu.age;
}
@Override
public int compareTo(student o) {
int num=this.age-o.age;
if(num == 0) {
this.name.compareTo(o.name);
}
return num;
}
}
输出的结果:
可以看到他的年龄是从小到大依次排列下来的。
package com.lixiang.Map;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Set;
import java.util.TreeMap;
public class HashMapDemo {
public static void main(String[] args) {
TreeMap map=new TreeMap<>();
map.put(new student("zzz",13), "1");
map.put(new student("lll",18), "2");
map.put(new student("yyy",38), "3");
map.put(new student("www",24), "4");
map.put(new student("qqq",15), "5");
map.put(new student("eee",20), "6");
map.put(new student("rrr",50), "7");
Set keySet = map.keySet();
for (Object object : keySet) {
System.out.println(object);
}
}
}
//比较器
class StuNameComp implements Comparator<student>{
public int compare(student o1, student o2) {
int num=o1.getName().compareTo(o2.getName());
if(num==0) {
return o1.getAge()-o2.getAge();
}
return num;
}
}
class student implements Comparable<student>{
private String name;
private int age;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public student() {
super();
}
@Override
public String toString() {
return "student [name=" + name + ", age=" + age + "]";
}
@Override
public int hashCode() {
return this.name.hashCode()+this.age;
}
@Override
public boolean equals(Object obj) {
student stu=(student) obj;
return this.name.equals(stu.name) && this.age ==stu.age;
}
@Override
public int compareTo(student o) {
int num=this.age-o.age;
if(num == 0) {
this.name.compareTo(o.name);
}
return num;
}
}
输出的结果为:
以上就是所有测试代码。
3、统计字符串中字符出现次数
思路:
例如定义一个字符串为:“sdlfjlsjflljlsjlfsldjfslFljWlfejWlejfl”
他输出的结果排序为(大写字母优先排序):a(4)b(9)…z(7)
1、分析结果得出结论:我们需要将字符a-z当作键key,将次数作为值value,
也就是说我们需要创建一个map集合来做这些事情
2、需要将待处理的字符串转成字符数组,以便于获取map集合的key
3、如果该字符(a)第一出现的时候,就给a对应key映射值value赋值为1
如果说该字符再次出现,那么就是value+1;
4、打印出a(4)b(9)…z(7)格式串
意味着需要对key进行排序
package com.lixiang.Map;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeMap;
public class TreeMapDemo {
public static void main(String[] args) {
String str = "sdlfjlsjflljlsjlfsldjfslFljWlfejWlejfl";
// Map<Character, Integer> map = new HashMap<>();
Map<Character, Integer> map = new TreeMap<>();
char[] charArray = str.toCharArray();
for (char c : charArray) {
Integer obj = map.get(c);
if(obj == null) {
// 之前没有出现过,这是第一次出现
map.put(c, 1);
}else {
// 之前这个字符已经出现过
map.put(c, ++obj);
}
}
StringBuilder sb = new StringBuilder();
Set<Entry<Character, Integer>> entrySet = map.entrySet();
for (Entry<Character, Integer> entry : entrySet) {
sb.append(entry.getKey()+"("+entry.getValue()+")");
}
System.out.println(sb);
}
}
输出后的结果为(自动排序,大写字母优先):
4、集合数组工具类
代码为:
package com.lixiang.Map;
import java.util.Arrays;
public class UtilDemo {
public static void main(String[] args) {
int arr[] = {32,453,654,757};
System.out.println(arr);
System.out.println(Arrays.toString(arr));
}
}
输出的结果为: