前言
今天这道题并不是很难,很好理解,就是考察对java中HaspMap的运用,另外还是不太习惯leetcode里这种输入方式,也不是不习惯,就是可能想太多了。
原题链接
1807. 替换字符串中的括号内容
https://leetcode.cn/problems/evaluate-the-bracket-pairs-of-a-string/
个人做题情况
这道题主要还是考察你对StringBuilder,HashMap以及List的理解吧,因为它限制了输入的形式,
所以你得去知道它们的含义,
下面贴出以下的核心要点:
StringBuilder的用法:
https://blog.csdn.net/qq_50617271/article/details/112686826?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522168110072016800186516167%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=168110072016800186516167&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2alltop_positive~default-1-112686826-null-null.142v82insert_down38,201v4add_ask,239v2insert_chatgpt&utm_term=stringbuilder&spm=1018.2226.3001.4187
Java中List集合介绍(炒鸡详细呦)
https://blog.csdn.net/weixin_45124488/article/details/102900223?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522168109755016800227447528%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=168109755016800227447528&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2alltop_positive~default-1-102900223-null-null.142v82insert_down38,201v4add_ask,239v2insert_chatgpt&utm_term=list%E9%9B%86%E5%90%88&spm=1018.2226.3001.4187
个人代码:
package Year2023.M04;
import java.util.*;
public class Day02 {
private static String s;
private static List<List<String>> knowledge;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//evaluate();
s = sc.nextLine();
List<List<String>> knowledge = new ArrayList<>();
int m = 2;
while(m-->0){
for (List<String> list_knowledges :knowledge){
list_knowledges.set(0,sc.nextLine());
list_knowledges.set(1,sc.nextLine());
}
}
System.out.println(evaluate(s,knowledge));;
sc.close();
}
private static String evaluate(String s, List<List<String>> knowledge) {
Map<String,String> map = new HashMap<String, String>();
for (List<String> list_knowledges :knowledge){
map.put(list_knowledges.get(0), list_knowledges.get(1));
}
StringBuilder key_dict = new StringBuilder();
StringBuilder normal_dict = new StringBuilder();
boolean isKey = false;
for (int i=0;i<s.length();i++){
char panduan = s.charAt(i);
if (panduan == '('){
isKey = true;
}
else if (panduan == ')') {
//此时添加对象到底了,不再添加
//到头了就要对前面获得的key_dict.append(panduan);进行判断
if (map.containsKey(key_dict.toString())){
normal_dict.append(map.get(key_dict.toString()));
}else{
normal_dict.append('?');
}
isKey = false;
key_dict.setLength(0);
}else {
//这里就是非()的判断,即判断字符能否被添加
if (isKey){
//如果可以添加到键值对匹配序列
key_dict.append(panduan);
}else{
//不可以,则加入常规队列
normal_dict.append(panduan);
}
}
}
return normal_dict.toString();
}
}
总结
大家可以看到我全的部分,我呢,想去实现在IDEA上完整的输入输出,
正如图片上看到的,我不清楚他这个输出的name,bob,age,two是怎么进行区别的,就是说,是直接就是输入name然后搞定,接下来输入bob
还是说,name+sc.next()然后输入bob这样
尝试了好久还是不知道怎么往List<List< string >> 这里面添加name ,bob 这样的元素,哎
太菜了,但是今天课很多,就先写到这里了= = ~还有别的事要去处理
要是有大佬懂我意思,并知道如何解决,欢迎留言。