思路:遍历1~n的所有数,把每个数都转为char数组,然后看1在数组中出现的次数,统计返回即可。代码如下:
public class Solution {
public int NumberOf1Between1AndN_Solution(int n) {
int count = 0;
for(int i=1;i<=n;i++){
String data = String.valueOf(i);
char[] dataChar = data.toCharArray();
for(char ch:dataChar){
String str = String.valueOf(ch);
if(str.equals("1")){
count++;
}
}
}
return count;
}
}