计算数字出现次数java_java – 使用数组计算每个数字的出现次数

我需要使用数组编写一个程序,它接受一个数字并返回该数字中每个数字的事件数.我想我可能在这里过于复杂.

import java.util.*;

class Exercice7 {

public static void main(String [] args) {

Scanner sc = new Scanner(System.in);

System.out.println(“Veuillez saisir un nombre naturel:”); // Get number

int n = sc.nextInt(); // Store number as n

String str = Integer.toString(n); // Store n as string

int length = str.length(); // Store string length as length

int arr[] = new int[length]; // Declare array with as many elements as n has digits

int digit[] = {0,1,2,3,4,5,6,7,8,9}; // Declare array with the digits to look for

int count = 0; // Number of occurences of each digit

for (int i=(length-1); i>=0; i–) { // Fill array with digits from number input

while (n>0) {

arr[i]= n%10;

n = n/10;

}

}

for (int j=0; j<10; j++) {

count = 0;

for (int i=0; i

if (arr[i]==digit[j]) {

count++;

}

}

if (count>0) {

System.out.println(digit[j] + ” occurs ” + count + ” times.”);

}

}

}

}

这段代码只返回0和1的数字,无论如何都是错的.有人能把我推向正确的方向吗?

    原文作者:七个隆冬
    原文地址: https://blog.csdn.net/weixin_33929779/article/details/114148703
    本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。
点赞