位置:武汉粤嵌教育IT技术培训机构 > 学校动态 > Java热搜问题大整理
public static void main(String[] args) { // public final static InputStream in = null; Scanner scanner = new Scanner(System.in); while (scanner.hasNext()){ String i = scanner.next(); System.out.println(i); } }
public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()){ int i = scanner.nextInt(); System.out.println(Math.sqrt(i)); } }
public static void main(String[] args) { int n= 16; System.out.println(n + "的八进制是:" + Integer.toOctalString(n)); System.out.println(n + "的二进制是:" + Integer.toBinaryString(n)); System.out.println(n + "的十六进制是:" + Integer.toHexString(n)); System.out.println(n + "的3进制是:" + Integer.toString(n, 3)); // radix进制的字符串s转10进制 Integer.parseInt((String) s,(int) radix); System.out.println(Integer.parseInt("121",3)); }
public static void main(String[] args) { double r1 = Math.random(); Random random2 = new Random(); int r2 = random2.nextInt(); Random random3 = new Random(1000); int r3 = random3.nextInt(); long r4 = System.currentTimeMillis() % 100; double r5 = Math.random(); }
public static void print9x9() { for (int i = 1; i <= 9; i++) { for (int j = 1; j <= 9; j++) { if (i >= j) { String oneItem = i + "*" + j + "=" + i * j + " "; System.out.print(oneItem); } } System.out.println(); } }
public static void main(String[] args) { System.out.println(isRevert(110)); } public static boolean isRevert(int num){ String value=Integer.toString(num); char array[]=value.toCharArray(); for (int i =0;i< value.length()/2;i++){ if (array[i]!= array[value.length() -i-1]){ return false; } } return true; }
class BinarySearch{ /* 二分法查找 */ public static void main(String[] args){ int[] arr = {1,2,3,4,5,6,7,8}; int a = 0; System.out.println(binarySearch(a,arr)); } // 二分法查找 static int binarySearch(int a,int[] arr){ // 较大索引 int maxIndex = arr.length -1; // 较小索引 int minIndex = 0; // 中间索引 int halfIndex = minIndex+(maxIndex-minIndex)/2; while (minIndex<=maxIndex){ // 找到时 if (arr[halfIndex]==a){ return halfIndex; }else if (arr[halfIndex]<a){// 比a小时 minIndex = halfIndex + 1; }else {// 比a大时 maxIndex = halfIndex - 1; } halfIndex = minIndex+(maxIndex-minIndex)/2; } return -1; } }
尊重原创文章,转载请注明出处与链接:http://www.peixun360.com/5732/news/456707/违者必究! 以上就是武汉粤嵌教育IT技术培训机构 小编为您整理 Java热搜问题大整理的全部内容。