浦发编程

1.输入一个数字要求输出该数字各个位上 能被2整除的数的和，如输入5584，输出12.

public class ABCTest {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String str = in.nextLine();
		in.close();
		System.out.println(sum(str));
	}
	public static int sum(String str) {
		int sum = 0;
		for(int i=0;i<str.length();i++) {
			int n = Integer.parseInt(str.charAt(i)+"");
			if(n%2==0)
				sum += n;
		}
		return sum;
	}
}

 

2.输入一组数N和数字b，求出该数组中能被b整除的个数，如输入1 2 3 4 5 6和2，结果输出为3.

public class ABCTest {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String str = in.nextLine();
		int b = in.nextInt();
		in.close();
		System.out.println(div(str,b));
	}
	public static int div(String strArr,int b) {
		int count = 0;
		String[] str = strArr.split(" ");
		for(int i=0; i<str.length;i++) {
			int n = Integer.parseInt(str[i]);
			if(n%b==0)
				count++;
		}
		return count;
	}
}

 

3.求N阶楼梯共有多少种上楼方式，每次只能上1个或者2个台阶。

public class ABCTest {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		System.out.println(stairs(n));
	}
	public static int stairs(int num) {
		if(num==0)
			return 0;
		if(num==1)
			return 1;
		if(num==2)
			return 2;
		return stairs(num-1)+stairs(num-2);
	}
}

 

4.求字符串的反转

public class ABCTest {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String str = in.nextLine();
		in.close();
		System.out.println(reverse(str));
	}
	public static String reverse(S