当前位置:网站首页>Baidu written test 2022.4.12 + programming topic: simple integer problem
Baidu written test 2022.4.12 + programming topic: simple integer problem
2022-04-23 15:08:00 【White horse is not a horse·】
package demo;
import java.util.*;
public class Main1 {
public static void main(String[] args) {
//List<Integer> list=new ArrayList<>(Arrays.asList(1,2,1,3,5,4,2,1,3,3));
// Input
Scanner cin=new Scanner(System.in);
int size=cin.nextInt();
cin.nextLine();
String string=cin.nextLine();
String[] arrstring= string.split(" ");
List<Integer> list=new ArrayList<>();
for(int i=0;i<arrstring.length;i++){
list.add(Integer.parseInt(arrstring[i])) ;
}
System.out.println(list);
// Store a set of data in a map Go to the assembly .
Map<Integer,Integer> map = new TreeMap();
for(int i=0;i<list.size();i++){
Integer count=1;
if(map.containsKey(list.get(i))){
count=map.get(list.get(i));
count++;
}
map.put(list.get(i),count); // Will automatically overwrite
}
// Put the set into the array ( Traverse )
int[][] data=new int[map.size()][2];
int i=0;
for (Map.Entry<Integer,Integer> entry : map.entrySet()) {
data[i][0] =entry.getKey();
data[i++][1] =entry.getValue();
}
// Sort the array
int m=0;
int n=0;
int result=0;
// Sort by the second column from large to small ,
Arrays.sort(data,(a,b)->{
if(a[1]==b[1]) return b[0]-a[0];
return b[1]-a[1];
});
System.out.println(Arrays.deepToString(data));
m=data[0][0];
Arrays.sort(data,(a,b)->{
if(a[1]==b[1]) return a[0]-b[0];
return a[1]-b[1];
});
System.out.println(Arrays.deepToString(data));
n=data[0][0];
result=m-n;
System.out.println("result="+result);
}
}
// Sum up your thoughts
1)Map Set up
2)Map Traversal of the set
package demo;
import java.util.*;
public class main3 {
public static void main(String[] args) {
// Change two sets of numbers into map aggregate
List<String> name=new ArrayList<>(Arrays.asList("a","b","c","d"));
List<Integer> age=new ArrayList<>(Arrays.asList(1,2,3,4));
Map<String,Integer> map=new TreeMap<>();
for(int i=0;i<name.size();i++){
map.put(name.get(i),age.get(i));
}
System.out.println(map);
// Count the number of elements in an array , And into map aggregate
List<Integer> data=new ArrayList<>(Arrays.asList(1,2,3,3,2,1,2,3,4,5,6,6,5,4,3));
Map<Integer,Integer> map1=new TreeMap<>();
for(int i=0;i<data.size();i++){
Integer count=1;
if(map1.containsKey(data.get(i))){
count=map1.get(data.get(i));
count++;
}
map1.put(data.get(i),count);
}
System.out.println(map1);
// The way to traverse
for(Map.Entry<String,Integer> entry: map.entrySet()){
String string=entry.getKey();
Integer integer=entry.getValue();
System.out.println("string="+string+" "+"integer="+integer);
}
}
}
版权声明
本文为[White horse is not a horse·]所创,转载请带上原文链接,感谢
https://yzsam.com/2022/04/202204231407525215.html
边栏推荐
- 调度系统使用注意事项
- 分享 20 个不容错过的 ES6 的技巧
- Alexnet model
- 大文件如何快速上传?
- C语言超全学习路线(收藏让你少走弯路)
- Ffmpeg installation error: NASM / yasm not found or too old Use --disable-x86asm for a clipped build
- The life cycle of key value in redis module programming
- How to design a good API interface?
- 让阿里P8都为之着迷的分布式核心原理解析到底讲了啥?看完我惊了
- [stc8g2k64s4] introduction of comparator and sample program of comparator power down detection
猜你喜欢
随机推荐
nuxt项目:全局获取process.env信息
setcontext getcontext makecontext swapcontext
PSYNC synchronization of redis source code analysis
Alexnet model
JUC learning record (2022.4.22)
Five data types of redis
脏读、不可重复读和幻读介绍
Nacos program connects to mysql8 0+ NullPointerException
like和regexp差别
Role of asemi rectifier module mdq100-16 in intelligent switching power supply
Three uses of kprobe
About UDP receiving ICMP port unreachable
SQLSERVER事物与锁的问题
Set up an AI team in the game world and start the super parametric multi-agent "chaos fight"
【thymeleaf】处理空值和使用安全操作符
Reptile exercises (1)
Vscode Chinese plug-in doesn't work. Problem solving
How to design a good API interface?
Error: unable to find remote key "17f718f726"“
[NLP] HMM hidden Markov + Viterbi word segmentation