每日java5-21

1

2 
1

3 
2  1

import java.util.Scanner;

public class shuzi {

public static void main(String[] args) {

Scanner
scanner = new Scanner(System.in);

System.out.print(“请输入一个值：”);

int n = scanner.nextInt();

displayPattern(n);

}

public static void displayPattern(int n) {

for (int i = 1; i <= n; i++) {

for (int j = n - i; j >= 1; j–) {

System.out.printf("%3s", “”);

}

for (int j = i; j >= 1; j–) {

System.out.printf("%3d", j);

}

System.out.println();

}

}

}

显示0和1构成的矩阵

import java.util.Scanner;

public class City {

public static void main(String[] args) {

Scanner
scanner = new Scanner(System.in);

System.out.print(“请输入一个值：”);

int n = scanner.nextInt();

printMatrix(n);

}

public static void printMatrix(int n) {

for (int i = 1; i <= n; i++) {

for (int j = 1; j <= n; j++) {

System.out.print(Math.round(Math.random())

• " ");

}

System.out.println();

}

}

}

103.一共含有多少个字母。

import java.util.Scanner;

public class ZiFuNum {

public static void main(String[] args) {

Scanner
sc=new Scanner(System.in);

System.out.println(“请输入字符串：”);

String
s=sc.nextLine();

System.out.println(“该字符串中一共含有”+countletters(s)+“个字母”);

}

public static int countletters(String s) {

int num=0;

for(int i=0;i<s.length();i++) {

if(Character.isLetter(s.charAt(i))) {

num++;

}

}

return num;

}

}

104.各个位的和

import java.util.Scanner;

public class GeWeihe {

public static void main(String[] args) {

Scanner
sc=new Scanner(System.in);

System.out.println(“输入一个整数：”);

long num=sc.nextLong();

System.out.println(num+“的各位数字之和为：”+sumDigits(num));

}

public static int sumDigits(long n) {

int sumTotal=0;

String
str=String.valueOf(n).toString();

for(int i=0;i<str.length();i++) {

char ch=str.charAt(i);

sumTotal=sumTotal+Integer.parseInt(String.valueOf(ch));

}

return sumTotal;

}

}

105.回文素数

public class HuiwenSushu {

public static void main(String[] args) {

int num=2;

int count=0;

while(count<10) {

if(isPalindrome(num)&&isPrime(num)) {

count++;

System.out.print("\t"+num);

if(count%5==0) {

System.out.println();

}

}

num++;

}

}

public static boolean isPalindrome(int num) {

int reNum=0;

int numTmp=num;

while(numTmp!=0) {

reNum=numTmp%10+(reNum*10);

numTmp=numTmp/10;

}

return num==reNum;

}

public static boolean isPrime(int num) {

for(int i=2;i<num;i++) {

if(num%i==0) {

return false;

}

}

return true;

}

}