java试读入一个16位的长整型，利用switch语句计算0—9这十个数字中，每个字出现的次数 输入一个16位的长整形数，利用switch语句统计其中0到9...
\u4e00\u9053JAVA\u9898\uff1a\u8bd5\u8bfb\u5165\u4e00\u4e2a16\u4f4d\u7684\u957f\u6574\u578b\uff0c\u5229\u7528switch\u8bed\u53e5\u8ba1\u7b970\u20149\u8fd9\u5341\u4e2a\u6570\u5b57\u4e2d\uff0c\u6bcf\u4e2a\u5b57\u51fa\u73b0\u7684\u6b21\u6570\uff1f\u601d\u8def\uff1a\u5148\u628a16\u4f4d\u7684\u957f\u6574\u578b\u8f6c\u6362\u6210\u5b57\u7b26\u4e32\uff0c\u518d\u5c06\u5b57\u7b26\u4e32\u62c6\u6210\u5b57\u7b26\u6570\u7ec4\uff0c\u5bf9\u5b57\u7b26\u6570\u7ec4\u8fdb\u884cswitch\uff0c\u5229\u7528\u4e00\u4e2aint\u6570\u7ec4\u6765\u50a8\u5b58\u6bcf\u4e2a\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570\u3002
\u5177\u4f53\u5b9e\u73b0\uff1a
\u6587\u4ef6\u540d\uff1aCountNum.java
import java.util.Scanner;
public class CountNum {
public static void main(String[] args){
System.out.println("\u8bf7\u8f93\u5165\u4e00\u4e2a16\u4f4d\u6570\u5b57");
Scanner sc = new Scanner(System.in);
long l = sc.nextLong();
String s = l+"";
char[] ca = new char[16];
s.getChars(0, s.length(), ca, 0);
int[] ia = new int[10];
for(int i=0;i<ca.length;i++){
switch(ca[i]){
case '0': ia[0]++;break;
case '1': ia[1]++;break;
case '2': ia[2]++;break;
case '3': ia[3]++;break;
case '4': ia[4]++;break;
case '5': ia[5]++;break;
case '6': ia[6]++;break;
case '7': ia[7]++;break;
case '8': ia[8]++;break;
case '9': ia[9]++;break;
}
}
System.out.println("\u7edf\u8ba1\u7ed3\u679c\u662f\uff1a");
for(int i=0;i<ia.length;i++){
System.out.println("\u6570\u5b57"+i+"\u51fa\u73b0\u4e86"+ia[i]+"\u6b21\u3002");
}
}
}
\u4f7f\u7528 java.util.Scanner \u63a5\u6536\u8f93\u5165\u3002\u3002\u3002\u3002\u3002\u3002\u3002\u3002\u3002\u3002\u518d\u5224\u65ad\u957f\u5ea6\u3001\u548c\u662f\u5426\u5168\u6570\u5b57\u7c7b\u578b
\u518d\u5b8c\u5584\u3002
Scanner sc = new Scanner(System.in);
long m = sc.nextLong();
包：
java.util.Scanner
简单地
import java.util.Scanner;
class DigitCounter{
public static void main(String args[]) throws Exception{
System.out.println("请输入十六位长整型数m: ");
Scanner sc = new Scanner(System.in);
long m = sc.nextLong();
String str = String.valueOf(m);
int counter[]=new int[10];
for(int i=0;i<str.length();i++){
// int p= (m/(Math.pow(10,i)) ).intValue();
int p = ((byte)str.charAt(i))-0x30;
switch(p){
case 0:
counter[0]++;
break;
case 1:
counter[1]++;
break;
case 2:
counter[2]++;
break;
case 3:
counter[3]++;
break;
case 4:
counter[4]++;
break;
case 5:
counter[5]++;
break;
case 6:
counter[6]++;
break;
case 7:
counter[7]++;
break;
case 8:
counter[8]++;
break;
default:
counter[9]++;
}
}
for(int i=0; i<10; i++){
System.out.println( String.format("%d出现的次数%d", i, counter[i] ) );
}
}
}
p=m/(Math.pow(10,i)); 这行是有问题的。。。p是一个int类型的,m/(Math.pow(10,i))结果是一个double类型的。。。
绛旓細import java.util.Scanner;public class CountNum { public static void main(String[] args){ System.out.println("璇疯緭鍏涓涓16浣鏁板瓧");Scanner sc = new Scanner(System.in);long l = sc.nextLong();String s = l+"";char[] ca = new char[16];s.getChars(0, s.length(), ca, ...
绛旓細Scanner sc = new Scanner(System.in);long m = sc.nextLong();鍖咃細java.util.Scanner 绠鍗曞湴 import java.util.Scanner;class DigitCounter{ public static void main(String args[]) throws Exception{ System.out.println("璇疯緭鍏鍗佸叚浣嶉暱鏁村瀷鏁癿: ");Scanner sc = new Scanner(System.in);l...
绛旓細import java.util.Scanner;import java.util.TreeMap;/** * 浠庨敭鐩樿緭鍏16浣嶉暱鏁存暟,缂栫▼缁熻姣忎釜鏁板瓧鍑虹幇鐨勪釜鏁 * @author young * */public class CharMapDemo {public static TreeMap<Character, Integer> Pross(String str) {char[] charArray = str.toCharArray();TreeMap<Character, Integer> ...
绛旓細import java.util.Scanner;public class Test12 { public static void main(String[] args) { int i;long num, temp;int[] count = new int[]{0,0,0,0,0,0,0,0,0};Scanner scan = new Scanner(System.in);//杈撳叆16浣嶇殑闀鏁村瀷鏁 while(true){ System.out.print("input a long num...
绛旓細浣跨敤 java.util.Scanner 鎺ユ敹杈撳叆銆傘傘傚啀鍒ゆ柇闀垮害銆佸拰鏄惁鍏ㄦ暟瀛楃被鍨 鍐嶅畬鍠勩
绛旓細浣犵殑in鏄暐锛熷鏋滄槸DataInputStream鎴朞bjectInputStream锛岄偅readUTF浼氭妸鏁翠釜瀛楃涓茶鍑烘潵鐨 浠ｇ爜涓嶅畬鏁达紝鏃犱粠寤鸿
绛旓細1.瀵紆til鍖 2.鐢⊿canner鐨勯潤鎬佹柟娉曟帴鏀2娆℃暟鎹 3.鍒ゆ柇锛屾墦鍗 鐪嬩綘闂繖绉嶉棶棰橈紝搴旇娌″鍒板紓甯革紝寮傚父灏变笉澶勭悊浜 浠ｇ爜濡備笅 import java.util.Scanner;public class IfElse {public static void main(String[] args) {// 瀹炰緥鍖朣canner绫籗canner in = new Scanner(System.in);// 鎺ユ敹鏁版嵁鐢╥nt[] ...
绛旓細long l=Long.parseLong(args[0]);// string str=String.valueOf(l);//long鍨嬬殑鏁版嵁杞崲涓篠tring
绛旓細/**杩欐槸涓涓鍛戒护琛岀増鏈紝浣跨敤鏃跺湪鍛戒护琛岃緭鍏java Maxnum <浣犺姣旇緝鐨勬暟锛屾暟瀛楅棿鐢ㄧ┖鏍煎垎寮>锛屾瘮濡俲ava Maxnum 22 33 2 56 38*/ public class Maxnum{ int num[];public int getMax(){ int temp;for(int i=0;i<num.length;i++)for(int j=1;j<num.length-i;j++){ if(num[i]<...
绛旓細import java.util.Scanner;public class App { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("璇疯緭鍏涓涓鏁存暟锛"); int number = scanner.nextInt(); while (number != 0) { int x = number % 10; System...
