Java Scanner.nextInt方法代码示例

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int number = in.nextInt();
    int[] array = new int[number];

    for (int i = 0; i < array.length; i++) {
        array[i] = in.nextInt();
    }

    int min1 = 2000000005, min2 = 2000000005, max1, max2;
    for (int i = 0; i < array.length; i++) {
        if (i - 1 >= 0)
            min1 = Math.abs(array[i] - array[i - 1]);
        if (i + 1 < array.length)
            min2 = Math.abs(array[i] - array[i + 1]);

        max1 = Math.abs(array[0] - array[i]);
        max2 = Math.abs(array[array.length - 1] - array[i]);

        System.out.println(Math.min(min1, min2) + " " + Math.max(max1, max2));
        min1 = 2000000005;
        min2 = 2000000005;
    }
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    while (sc.hasNext()){
        int n = sc.nextInt();
        int minPower = 0;
        Queue<Integer> queue = new PriorityQueue<>();

        for(int i=0; i<n; i++){
            queue.add(sc.nextInt());
        }

        int first = 0, second = 0, temp = 0;
        while (queue.size() > 1){
            first = queue.poll();
            second = queue.poll();
            temp = first + second;
            queue.add(temp);

            minPower += temp;
        }
        System.out.println(minPower);
    }
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int T = scan.nextInt();
    while (T-- > 0) {
        int N = scan.nextInt();
        char [][] grid = new char[N][N];
        for (int i = 0; i < N; i++) {
            String str = scan.next();
            for (int j = 0; j < str.length(); j++) {
                grid[i][j] = str.charAt(j);
            }
        }
        System.out.println(canConvert(grid) ? "YES" : "NO");
    }
    scan.close();
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    /* Save input */
    Scanner scan = new Scanner(System.in);
    int m = scan.nextInt();
    int n = scan.nextInt();
    String [] magazine = new String[m];
    for (int i = 0; i < m; i++) {
        magazine[i] = scan.next();
    }
    String [] ransom = new String[n];
    for (int i = 0; i < n; i++) {
        ransom[i] = scan.next();
    }
    scan.close();
    
    /* Attempt to create a ransom letter */
    if (magazine.length < ransom.length) {
        System.out.println("No");
    } else {
        canCreate(magazine, ransom);
    }
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner x = new Scanner(System.in);
    PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
    int n = x.nextInt(), c;
    int a[] = new int[701];
    for (int i = 0; i < n; i++) {
        c = x.nextInt();
        a[c]++;
    }
    int s = 0;
    for (int i = 600; i < a.length; i++) {
        s += a[i] / 4;
    }
    writer.print(s);
    writer.close();
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    /* Save input */
    Scanner scan = new Scanner(System.in);
    int size         = scan.nextInt();
    int numRotations = scan.nextInt();
    int array[] = new int[size];
    for (int i = 0; i < size; i++) {
        array[i] = scan.nextInt();
    }
    scan.close();
    
    /* Rotate array (in place) using 3 reverse operations */
    numRotations %= size; // to account for numRotations > size
    int rotationSpot = size - 1 - numRotations;
    reverse(array, 0, size - 1);
    reverse(array, 0, rotationSpot);
    reverse(array, rotationSpot + 1, size - 1);
    
    /* Print rotated array */
    for (int i = 0; i < size; i++) {
        System.out.print(array[i] + " ");
    }
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args)
{
	Scanner sc = new Scanner(System.in);
	System.out.println("请输入4位会员卡号：");
	int a = sc.nextInt();
	int gewei = a % 10;
	int shiwei = a / 10 % 10;
	int baiwei = a / 100 % 10;
	int qianwei = a / 1000;
	System.out.println("会员卡号" + a + "各位之和" + (gewei + shiwei + baiwei + qianwei));
	boolean cus = true;
	System.out.println("是幸运客户吗？");
	if ((gewei + shiwei + baiwei + qianwei) > 20)
	{
		System.out.println(cus);
	} else
	{
		cus = false;
		System.out.println(cus);
	}
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    //System.out.println("Enter the number of items");
    int N = sc.nextInt();
    //System.out.println("Enter the capacity of the knapsack");
    int C = sc.nextInt();
    int[] W = new int[N];
    int[] V = new int[N];
    int[] L = new int[N];

    //System.out.println("Enter the weight, value and upper bound of each item");
    for (int i = 0; i < N; i++) {
        W[i] = sc.nextInt();
        V[i] = sc.nextInt();
        L[i] = sc.nextInt();
    }

    boolean optimize = true;
    int solution = convertToZeroOne(N, W, V, L, C, optimize);

    //System.out.println("The maximum value that the knapsack can store is: ");
    System.out.println(solution);
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    int n, k = 0;
    Scanner x = new Scanner(System.in);
    n = x.nextInt();
    int a[][] = new int[n][n];
    for (int i = 0; i < 2 * n - 1; i++) {
        for (int j = 0; j <= i; j++) {
            if (j < n && n - i + j - 1 >= 0 && n - i + j - 1 < n) a[j][n - i + j - 1] = ++k;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            System.out.print(a[i][j] + " \t");
        }
        System.out.println();
    }
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[]args){
boolean sc;

Scanner input = new Scanner(System.in);
System.out.println("请输入4位会员卡号：\n");
int member = input.nextInt();

int gewei = member%10;
int shiwei = member/10%10;
int baiwei = member/100%10;
int qianwei =member/1000;

member = gewei+shiwei+baiwei+qianwei;
sc = member > 20;
System.out.println("是幸运顾客吗？"+sc);
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int total = sc.nextInt();
    int[] arr = new int[total];

    for(int i=0; i<total; i++){
        arr[i] = sc.nextInt();
    }
    Arrays.sort(arr);

    for(int i=0; i<total; i++){
        System.out.println(arr[i]);
    }
    
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) 
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
in.close();
System.out.println(factorial(n));
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int L = scan.nextInt();
    int R = scan.nextInt();
    scan.close();
    
    int xored  = L ^ R;
    int significantBit = 31 - Integer.numberOfLeadingZeros(xored);
    int result = (1 << (significantBit + 1)) - 1;

    System.out.println(result);
}
 

import java.util.Scanner; //导入方法依赖的package包/类
public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int T = scan.nextInt();
    while (T-- > 0) {
        int A = scan.nextInt();
        int B = scan.nextInt();
        int numSquares = (int) (Math.floor(Math.sqrt(B)) - Math.ceil(Math.sqrt(A)) + 1);
        System.out.println(numSquares);
    }
    scan.close();
}
 

import java.util.Scanner; //导入方法依赖的package包/类
private static Integer acceptChoice(Scanner reader){
	System.out.println("************Advanced Calculator************");
	System.out.println("1. Prime Number check");
	System.out.println("2. Even Number check");
	System.out.println("3. Sum of N Primes");
	System.out.println("4. Sum of N Evens");
	System.out.println("5. Sum of N Odds");
	System.out.println("6. Exit");
	System.out.println("Enter the number to choose operation");
	return reader.nextInt();
}