目录
一、编程题
1.最难的问题
链接:最难的问题__牛客网 (nowcoder.com)
🔎解题思路:
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
String str = scanner.nextLine();
StringBuilder sb = new StringBuilder();//需要字符串拼接
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if(ch == ' ') {
sb.append(' ');
} else {
sb.append((char)(ch > 'E' ? ch-5 : ch+21));//使用三目操作符,并且转化为字符串
}
}
System.out.println(sb);
}
}
2.因子个数
链接:因子个数__牛客网 (nowcoder.com)
🔎做题思路:
流程图 :
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
int n = scanner.nextInt();
int count = 0;
for (int i = 2; i < Math.sqrt(n); i++) {//从2开始到根号n
//如果可以分解,则可以继续分解
if (n % i == 0) {
while (n % i == 0) {
n = n / i;
}
count++;
}
}
if (n != 1) {
count++;
}
System.out.println(count);
}