最近做了一道题目: Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 Note:Assume we are dealing with an environment which could only store intege
刚刚看到一个面试题:写一个函数,输入int型,返回整数逆序后的字符串.如:输入123,返回"321". 要求必须用递归,不能用全局变量,输入必须是一个參数.必须返回字符串." package cn.baokx; public class Test { public static void main(String[] args) { System.out.println(fun(12345678)); } public static String fun(int num){ i
转 import java.util.ArrayList; import java.util.Scanner; public class Test { public static void main(String[] args) { ArrayList<Student> list = new ArrayList<Student>();//定义一个学生类 Scanner input = new Scanner(System.in);//创建一个扫描器对象,用于读取从控制台输入 int
使用Scanner类获取输入,连续获取int类型和String类型数据时候,发生错误. Scanner sc = new Scanner(System.in); System.out.println("输入int类型"); int a = sc.nextInt(); System.out.println("输入String类型"); String s = sc.nextLine(); System.out.println(a); System.out.println