java在线编译:https://www.onlinegdb.com/
写出一个程序,接受一个由字母和数字组成的字符串,和一个字符,然后输出输入字符串中含有该字符的个数,不区分大小写。
import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner in =new Scanner(System.in);
while (in.hasNext()) {
String src=in.next();
String des=in.next();
String s=des.toLowerCase();
String str=src.toLowerCase();
char[] arr=str.toCharArray();
int num=0;
for(int i=0;i<arr.length;i++){
if(s.equals(String.valueOf(arr[i]))){
num++;
}
}
System.out.println(num);
}
}
}
import java.util.*;
public class Main
{
public static void main(String[] args) {
int size=getSize();
System.out.println(size);
}
private static int getSize(){
Scanner s = new Scanner(System.in);
String count=s.nextLine();
String numberString=s.nextLine();
Boolean[] numAll=new Boolean[Integer.parseInt(count)];
String[] strs = numberString.split(" ");
for (int i = 0; i < strs.length; i++) {
int index = Integer.parseInt(strs[i]);
numAll[index]=!numAll[index];
}
int number=0;
for (int i = 0; i < numAll.length; i++) {
if (numAll[i]){
number++;
}
}
return number;
}
private static int getCount(){
int left=0;
int right=0;
Scanner s = new Scanner(System.in);
String str=s.nextLine();
for(int i=0;i<str.length();i++){
char a=str.charAt(i);
if(a=='('){
left++;
}
if(a==')'){
right++;
}
if(right>left){
return -1;
}
}
if(right==left){
return left;
}else{
return -1;
}
}
}
猴子爬阶梯 每次向上爬一级或者三级,问爬上n级阶梯有多少种爬法?
public class Main
{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int count=in.nextInt();
int[] n=new int[51];
n[1]=1;
n[2]=1;
n[3]=2;
for(int i=4;i<=count;i++){
n[i]=n[i-1]+n[i-3];
}
System.out.println(n[count]+"");
}
}