目录
练习题一:通过HashMap统计字符出现的次数
例如:统计aaabbbcccddd123出现的次数
package com.jt.string;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class TestMapApi {
public static void main(String[] args) {
//1.创建用户所需
System.out.print("请输入你要统计的字符:");
String str = new Scanner(System.in).next();
//2.创建hashmap集合
Map<String, Integer> hashMap = new HashMap<>();
for (int i = 0; i < str.length(); i++) {
//3.将字符串的字符设置为HashMap的key
String key =String.valueOf(str.charAt(i));
//4.将出现的次数设置为HashMap的value
Integer value = hashMap.get(key);
//6.判断是否存在key不存在就加入,存在就在value+1
if(value==null){
hashMap.put(key, 1);
}else {
hashMap.put(key,value+1);
}
}
System.out.println(hashMap);
}
}
请输入你要统计的字符:aaabbbcccddd123
{a=3, 1=1, b=3, 2=1, c=3, 3=1, d=3}
Process finished with exit code 0
练习题二:两数之和
例如:将数组{0,1,2,3,4,5,6,7,8,9,10}组合得到目标值,并返回下标(不能重复利用元素)
package com.tede.arrays;
import java.util.HashMap;
import java.util.Scanner;
public class TestTwoSum {
public static void main(String[] args) {
System.out.print("请输入目标值:");
int target = new Scanner(System.in).nextInt();
int[] nums ={0,1,2,3,4,5,6,7,8,9,10};
twoSum(nums, target);
}
public static void twoSum(int[] nums, int target) {
int len = nums.length;
HashMap<Integer, Integer> hashtable = new HashMap<>(len-1);
if (target == 0) {
System.out.println("不合法!");
return;
}
for (int i = 0; i < len; i++) {
if (hashtable.containsKey(target-nums[i])){
System.out.print("["+hashtable.get(target-nums[i])+","+i+"]");
}
hashtable.put(nums[i],i);
}
}
}
请输入目标值:10
[4,6][3,7][2,8][1,9][0,10]
Process finished with exit code 0