【java】第6章 方法 测试题（作业部分）

6.2

package wwr;
//6.2
import java.util.Scanner;
public class Demo {
	
	public static int sumDigits(long n)
	{
		long sum = 0;
		while(n > 0)
		{
			sum += (n % 10);
			n /= 10;
		}
		return (int)sum;
	}
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in); 
		System.out.print("Please inpute a integer: ");
		long num = input.nextInt();
		System.out.print(sumDigits(num));
	}

}

6.3

package wwr;
//6.3
import java.util.Scanner;
public class Demo {
	
	public static int reverse(int number)
	{
		int tmp = 0;
		while(number > 0)
		{
			tmp *= 10;
			tmp += (number % 10);
			number /= 10;
		}
//		System.out.println(tmp);
		return tmp;
	}
	public static boolean isPalindrome(int number)
	{
		if(number == reverse(number))
			return true;
		else
			return false;
	}
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in); 
		System.out.print("Please inpute a integer: ");
		int num = input.nextInt();
		if(isPalindrome(num))
			System.out.print(num + " is a palindrome");
		else
			System.out.print(num + " is not a palindrome");
	}

}

6.13

【注】
1、eclipse光标变成黑块，是因为不小心按了Insert，再按一次就回来了QAQ

2、java也可以用C里面的printf，制表控制输出格式就比较方便了

package wwr;
//6.13
import java.util.Scanner;
public class Demo {
	
	public static double m(int i)
	{
		double ans = 0;
		for(int j = 1; j <= i; j++)
		{
			double k = (double)j;
			ans += k / (k + 1);
		}
		return ans;
	}

	public static void main(String[] args) {
		System.out.println("i		m(i)");
		System.out.println("——————————————————————");
		for(int i = 1; i <= 20; i++)
		{
			if(i < 10)
				System.out.print(" ");
			System.out.print(i);
			System.out.printf("%20.4f\n", m(i));
		}
	}

}

6.18

package wwr;
//6.18
import java.util.Scanner;
public class Demo {
	
	public static boolean check(String s)
	{
		int num = 0;
		if(s.length() != 8)
			return false;
		for(int i = 0; i < s.length(); i++)
		{
			if(num < 2 && '0' <= s.charAt(i) && s.charAt(i) <= '9')
				num++;
			else if((s.charAt(i) < 'a' || 'z' < s.charAt(i)) &&
					(s.charAt(i) < 'A' || 'Z' < s.charAt(i)))
				return false;
		}
		if(num < 2)
			return false;
		return true;
	}
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		System.out.print("Please inpute a Password: ");
		String s = input.nextLine();
		if(check(s))
			System.out.print("Valid Password");
		else
			System.out.print("Invalid Password");
	}

}

6.23

【注】char类型输入：没有nextChar！！！
要用char c = input.next().charAt(0);

package wwr;
//6.23
import java.util.Scanner;
public class Demo {
	
	public static int count(String str, char a)
	{
		int num = 0;
		for(int i = 0; i < str.length(); i++)
		{
			if(str.charAt(i) == a)
				num++;
		}
		return num;
	}
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		System.out.println("Please inpute a string and a character: ");
		String s = input.nextLine();
		char c = input.next().charAt(0);
		System.out.print(count(s, c));
	}
	
}

6.28

【注】梅森素数
（当long都是int的时好像没法输出31？？？？？

package wwr;
//6.28
import java.util.Scanner;
public class Demo {
	
	public static boolean Prime(long n)
	{
		boolean flag = false;
		long b = (long)Math.sqrt(n);
		for(long i = 2; i <= b; i++)
		{
			if(n % i == 0)
				return false; 
		}
		return true;
	}
	public static long Mersenne(long p)
	{
		return (long)Math.pow(2, (double)p) - 1;
	} 
	public static void main(String[] args) {
		System.out.println("p		2^p-1");
		System.out.println("——————————————————————————");
		for(long i = 2; i <= 31; i++)
		{
			
			long tmp = Mersenne(i); 
			if(Prime(tmp))
				System.out.println(i + "		" + tmp);
		}
	}
	
}

6.29

package wwr;
//6.29
import java.util.Scanner;
public class Demo {
	
	public static boolean Prime(long n)
	{
		boolean flag = false;
		long b = (long)Math.sqrt(n);
		for(long i = 2; i <= b; i++)
		{
			if(n % i == 0)
				return false; 
		}
		return true;
	}
	public static void main(String[] args) {
		for(long i = 3; i <= 1000; i++)
		{
			if(Prime(i) && Prime(i + 2))
				System.out.println("(" + i + ", " + (i + 2) + ")");
		}
	}
	
}