当前位置：网站首页>记录一下我的刷题实录
记录一下我的刷题实录
2022-06-11 00:50:00 【CodeMartain】
先说一下刷题的初衷----->>
刷题这个就跟做数学题一样,一是为了查漏补缺,另一个是为了…没错就是money (俗,俗不可耐,但…华为机考肝了)
开始—>>
1,
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc= new Scanner(System.in);
String str=sc.nextLine();
System.out.println(SplitStr(str));
sc.close();
}
public static int SplitStr(String string){
String[] str=string.split(" ");
return str[str.length-1].toCharArray().length;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String str = scanner.nextLine();
String next = scanner.next();
char[] chars = next.toCharArray();
char ch = chars[0];
System.out.println(AppearTime(str, ch));
}
public static int AppearTime(String str, char ch) {
char[] chars = str.toCharArray();
int result = 0;
for (int i = 0; i < chars.length; i++) {
if (String.valueOf(chars[i]).equalsIgnoreCase(String.valueOf(ch))) {
result += 1;
}
}
return result;
}
}
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int num = scanner.nextInt();
HashSet<Integer> hashSet = new HashSet<>();
for (int i = 0; i < num; i++) {
int number = scanner.nextInt();
hashSet.add(number);
}
scanner.close();
hashSet.forEach(System.out::println);
}
}
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc = new Scanner(System.in);
String next=sc.next();
if (next.contains("0x")||next.contains("0X")){
String str= next.substring(2);
Integer integer = Integer.parseInt(str, 16);
System.out.println(integer);
}else{
Integer integer = Integer.parseInt(next, 16);
System.out.println(integer);
}
sc.close();
}
}
public class Test4 {
public static void main(String[] args) {
Scanner scanner= new Scanner(System.in);
long l = scanner.nextLong();
Demo(l);
// System.out.println(l>>1);能用位操作实现吗?-
scanner.close();
}
public static void Demo(long l){
for (int i = 2; i <=l ; i++) {
//都除一遍,挨个查找
if (l%i==0){
System.out.println(i+" ");
Demo(l/i);
break;
}
// 最后收个尾巴
if(i==l){
System.out.println(i+" ");
}
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
double num=sc.nextDouble();
int x=NumDemo(num);
sc.close();
System.out.print(x);
}
public static int NumDemo(double num){
double n=num-(int)num;
if(n>=0.5){
int m=(int)num+1;
return m;
}
int m=(int)num;
return m;
}
}
主要是 map.merge(m, n, Integer::sum)方法
指定的 key 是否存在，如果不存在，则添加键值对到 hashMap 中。
如果 key 对应的 value 不存在，则返回该 value 值，如果存在，则返回通过 remappingFunction 重新计算后的值。
import java.util.*;
public class Main {
public static void main(String args[]) {
Show();
}
public static void Show() {
Map<Integer, Integer> map = new HashMap<>();
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
for (int i = 0; i < num; i++) {
int m = sc.nextInt();
int n = sc.nextInt();
map.merge(m, n, Integer::sum);
}
map.keySet().stream().sorted().forEach(k -> System.out.println(k + " " + map.get(k)));
sc.close();
}
}
import java.util.*;
public class Test6 {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
char[] chars = s.toCharArray();
//Set中的LinkedHashSet就是有序的
LinkedHashSet<Character> set = new LinkedHashSet<>();
for (int i = chars.length - 1; i >= 0; i--) {
set.add(chars[i]);
}
Iterator<Character> it = set.iterator();
while (it.hasNext()) {
System.out.print(it.next());
}
}
}
import java.util.HashSet;
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
String str=sc.nextLine();
char[]ch=str.toCharArray();
HashSet <Character> set= new HashSet();
for(int i=0;i<ch.length;i++){
set.add(ch[i]);
}
System.out.println(set.size());
sc.close();
}
}
发一个他人写的另一个解法---->>
import java.util.Scanner;
import java.util.BitSet;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String line = scanner.next();
//总共有128个字符。字需要用128位
BitSet bitSet = new BitSet(128);
for (char c : line.toCharArray()) {
//判断字符c是否已出现
if (!bitSet.get(c)) {
//未出现就设置为已出现
bitSet.set(c);
}
}
//统计有多少字符已出现过
System.out.println(bitSet.cardinality());
}
}
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc = new Scanner(System.in);
int num=sc.nextInt();
reverseNum(num);
sc.close();
}
public static void reverseNum(int num){
String str=String.valueOf(num);
char ch[]=str.toCharArray();
for(int i=ch.length-1;i>=0;i--){
System.out.print(ch[i]);
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc = new Scanner(System.in);
String str=sc.next();
System.out.println(lowStr(str));
}
public static String lowStr(String str){
String string=str.toLowerCase();
StringBuilder sb= new StringBuilder(string);
return sb.reverse().toString();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str=sc.nextLine();
Words(str);
sc.close();
}
public static void Words(String str){
String[]string=str.split(" ");
for(int i=string.length-1;i>=0;i--){
System.out.print(string[i]+" ");
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String []args){
Scanner sc = new Scanner(System.in);
int num=sc.nextInt();
char[] ch =Integer.toBinaryString(num).toCharArray();
int count=0;
for(int i =0;i<ch.length-1;i++){
if(ch[i]=='1'){
}
count+=1;
}
sc.close();
System.out.print(count);
}
}
public class Test8{
public static void main(String args[]){
sortedStr();
}
public static void sortedStr(){
Scanner sc= new Scanner(System.in);
int count=sc.nextInt();
if(count<=0){
return;
}
String[]strings=new String[count];
for(int i=0;i<strings.length;i++){
strings[i]=sc.next();
}
sc.close();
Arrays.sort(strings);
for (String string : strings) {
System.out.println(string);
}
}
}
import java.util.*;
import java.util.stream.Stream;
public class Main {
public static void main(String args[]) {
// System.out.println("A10".matches("^A\\d{1,2}"));
ZB();
}
public static void ZB() {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
String strings[] = str.split(";");
//处理数组去掉不符合的
// 含A的,D的
HashMap<String, Integer> hashMap = new HashMap<>();
for (int i = 0; i < strings.length; i++) {
if (strings[i].matches("^A\\d{1,2}")) {
String[] as = strings[i].split("A");
hashMap.merge("A", Integer.valueOf(as[1]), Integer::sum);
}
else if (strings[i].matches("^D\\d{1,2}")) {
String[] as = strings[i].split("D");
hashMap.merge("D", Integer.valueOf(as[1]), Integer::sum);
}
else if (strings[i].matches("^W\\d{1,2}")) {
String[] as = strings[i].split("W");
hashMap.merge("W", Integer.valueOf(as[1]), Integer::sum);
}
else if (strings[i].matches("^S\\d{1,2}")) {
String[] as = strings[i].split("S");
hashMap.merge("S", Integer.valueOf(as[1]), Integer::sum);
}else{
continue;
}
}
Integer a = hashMap.get("A");
Integer d = hashMap.get("D");
Integer s = hashMap.get("S");
Integer w = hashMap.get("W");
System.out.println((d-a) + "," + (w - s));
sc.close();
}
}
package com.gavin.shuati;
import java.util.Scanner;
public class Test12 {
public static void main(String []args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
System.out.println(ChangePwd(s));
sc.close();
}
public static String ChangePwd(String str) {
str = str.replaceAll("[a-c]", "2");
str = str.replaceAll("[d-f]", "3");
str = str.replaceAll("[g-i]", "4");
str = str.replaceAll("[k-l]", "5");
str = str.replaceAll("[m-o]", "6");
str = str.replaceAll("[p-s]", "7");
str = str.replaceAll("[t-v]", "8");
str = str.replaceAll("[w-z]", "9");
//转为字节数组
char[] ch = str.toLowerCase().toCharArray();
for (int i = 0; i < ch.length; i++) {
if ((int) ch[i] > 96 && (int) ch[i] < 123) {
ch[i] = (char) ((int) ch[i] + 1);
if ((int) ch[i] == 123) {
ch[i] = 'a';
}
}
}
return new String(ch);
}
}
边栏推荐
- Initialize the one-dimensional array a correctly
- Task05: tree
- 【圖像處理】基於matlab GUI多功能圖像處理系統【含Matlab源碼 1876期】
- [leetcode] a group of K flipped linked lists
- 中国各省份省会的坐标
- [matlab] image restoration
- flutter_swiper 轮播图 插件
- Metersphere tutorial: how to assert when the returned result of the interface is null
- How to change the theme of win11 touch keyboard? Win11 method of changing touch keyboard theme
- CLIP论文详解
猜你喜欢
flutter_ Swiper carousel map plug-in
Linux Installation MySQL database details
ABAP CDS实现多行字段内容拼接
![[leetcode] construct a binary tree by traversing the sequence from front to middle (continuous optimization)](/img/02/114618065e090769543a2aa106aa66.jpg)
[leetcode] construct a binary tree by traversing the sequence from front to middle (continuous optimization)
![[leetcode] different binary search trees (recursion - recursion + memory search optimization - dynamic programming)](/img/ae/a6e7b8ebb098f631344024ffa80e76.jpg)
[leetcode] different binary search trees (recursion - recursion + memory search optimization - dynamic programming)
How to reinstall win11 drawing tool when it is missing
In May, the main growth ranking list (platform of station B) of the single flying melon data up was released
面试官：介绍一下你简历中的项目，细讲一点，附项目实战
Task01: be familiar with the basic process of news recommendation system
![[leetcode] merge K ascending linked lists](/img/ff/054b7c14ce678fbdf45af780261b8c.jpg)
[leetcode] merge K ascending linked lists
随机推荐
[matlab] image restoration
[music] playing blue and white porcelain based on MATLAB [including Matlab source code 1873]
Linux Installation MySQL database details
Dialog alertdialog, simpledialog, showmodalbottomsheet, showtoast shutter custom dialog
【HaaS Hands-On】全新视频节目上线 创意案例我们一起上手做 第一期E01： 物联网工程师 和你一起上手做遥控机械臂
Matlab digital operation function notes
逻辑漏洞 / 业务漏洞
Win11怎么更改管理员头像？Win11更换管理员头像的方法
Deep exploration of functions with indefinite parameters in C language
Question g: candy
Task01: be familiar with the basic process of news recommendation system
SAP SMARTFORMS文本内容手动换行输出
Complete tutorial on obtaining voltage from QGC ground station (APM voltage cannot be obtained from QGC)
[leetcode] LRU cache
flutter 状态管理
Understanding of pointers
[untitled]
【MATLAB】图像分割
[leetcode] path sum II (first glimpse recursion + backtracking)
爱思唯尔---Elseviewer---预印本在线发表通知