2018-02-01 下午 16:13
对与今天写的几道题的方法思路进行归纳总结:
1)杨辉三角输出:
先处理杨辉三角中的 "1",再将其中需要进行计算的,根据其二维数组下标规律进行运算(切记要存进数组里面)
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[][] arr = new int[n][n];
for (int i = 0; i <n; i++) {
for (int j = 0; j <=i; j++) {
if(i<2||j==0||j==i)
{
arr[i][j]=1;
System.out.print(1 + " ");
}else {
arr[i][j] = arr[i-1][j-1]+arr[i-1][j];
System.out.print(arr[i-1][j-1]+arr[i-1][j] + " ");
}
}
System.out.println();
}
scanner.close();
}
2)判断五位到六位十进制回文数 并且将 每一位的数字进行加和结果与给出的一样的输出
思路:先将数字转化为String类型,再转化为StringBuffer类型,翻转字符串,逐位进行比较记录相同的总数,若纪录的数与字符串相同,则为回文数,再将字符串转化为整形数组,逐位相加后与给出数字相比较,相同即可输出
import java.util.Scanner;
public class Main2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int num = 10000;
for (int k = num; k <= 999999; k++) {
String src = String.valueOf(k);
// 翻转字符串与每一位比较
StringBuffer sb = new StringBuffer(src);
sb.reverse();
int count = 0;
for (int i = 0; i < src.length(); i++) {
if (src.charAt(i) == sb.charAt(i)) {
count++;
}
}
int total = 0;
if (count == src.length()) {
// 将字符串转化为数组
int[] arr = new int[src.length()];
for (int i = 0; i < src.length(); i++) {
Character ch = src.charAt(i);
arr[i] = Integer.parseInt(ch.toString());
total += arr[i];
}
if (total == n) {
System.out.println(k);
}
} else {
}
}
}
}