acwing相关复盘

6713. 求最值问题 - AcWing题库

import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int n = sc.nextInt(); int max = Integer.MIN_VALUE; int min = Integer.MAX_VALUE; for(int i = 0; i < n; i++){ int num = sc.nextInt(); if(num > max){ max = num; } if(num < min){ min = num; } } System.out.println(max + " " + min); } } }

6714. 新对称素数问题 - AcWing题库

import java.util.*; public class Main{ public static void main(String[] args){ //输入 Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for(int i = 0; i < n; i++){ long num = sc.nextLong(); if(num <= 99999 && isSymmetric(num) && isPrime(num)){ System.out.println("Yes"); }else{ System.out.println("No"); } } } //是否对称 public static boolean isSymmetric(long num){ String s = Long.toString(num); int left = 0; int right = s.length() - 1; while(left < right){ if(s.charAt(left) != s.charAt(right)){ return false; } left++; right--; } return true; } //是否是素数 public static boolean isPrime(long num){ if(num <= 1){ return false; } if(num == 2){ return true; } if(num % 2 == 0){ return false; } else{ for(int i = 3; i * i <= num / 2; i++){ if(num % i == 0){ return false; } } } return true; } }

6715. 进制转换 - AcWing题库

import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); int t = sc.nextInt(); String digits = "0123456789ABCDEF"; for(int i = 0; i < t; i++){ int n = sc.nextInt(); int r = sc.nextInt(); boolean isNegative = n < 0; int num = Math.abs(n); StringBuilder sb = new StringBuilder(); if(num == 0){ sb.append("0"); }else{ while(num > 0){ int remainder = num % r; sb.append(digits.charAt(remainder)); num /= r; } sb.reverse(); } if(isNegative){ sb.insert(0,"-"); } System.out.println(sb); } } }

1210. 连号区间数 - AcWing题库

import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] nums = new int[n]; int count = 0; for(int i = 0; i < n; i++){ nums[i] = sc.nextInt(); } for(int l = 0; l < n; l++){ int max = nums[l]; int min = nums[l]; for(int r = l; r < n; r++){ max = Math.max(max,nums[r]); min = Math.min(min,nums[r]); if(max - min == r - l){ count++; } } } System.out.println(count); } }