PAT习题： General Palindromic Number (20)

小编准备考PAT甲级的证，因此开始刷题中。将刷过的题及自己所编的代码进行整理分享。

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Although palindromic numbers are most often considered in the decimal system, the concept of palindromicity can be applied to the natural numbers in any numeral system. Consider a number N > 0 in base b >= 2, where it is written in standard notation with k+1 digits ai as the sum of (ai bi ) for i from 0 to k. Here, as usual, 0 <= ai < b for all i and ak is non-zero. Then N is palindromic if and only if ai = ak-i for all i. Zero is written 0 in any base and is also palindromic by definition.

Given any non-negative decimal integer N and a base b, you are supposed to tell if N is a palindromic number in base b.

输入描述:

Each input file contains one test case. Each case consists of two non-negative numbers N and b, where 0 <= N <= 109 is the decimal number and 2 <= b <= 109 is the base. The numbers are separated by a space.

输出描述:

For each test case, first print in one line “Yes” if N is a palindromic number in base b, or “No” if not. Then in the next line, print N as the number in base b in the form “ak ak-1 … a0”. Notice that there must be no extra space at the end of output.

示例1
输入

27 2

输出

Yes
1 1 0 1 1

代码：

package Match;

import java.util.Scanner;

/**
 * General Palindromic Number (20
 * 
 * @version 1.0
 * @author Liu
 */
public class Match1019 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int num = scanner.nextInt();
		int base = scanner.nextInt();

		String string = toBaseString(num, base);
		String[] strings = string.split(" ");
		int[] nums = new int[strings.length];
		for (int i = 0; i < nums.length; i++) {
			nums[i] = Integer.parseInt(strings[i]);
		}

		boolean flag = true;
		for (int i = 0; i < nums.length / 2; i++) {
			if (nums[i] == nums[nums.length - i - 1]) {
				continue;
			} else {
				flag = false;
				System.out.println("No");
				break;
			}
		}
		if (flag) {
			System.out.println("Yes");

		}
		for (int i = 0; i < nums.length; i++) {
			System.out.print(nums[i] + " ");
		}

	}

	public static String toBaseString(int num, int base) {
		String result = "";
		int yushu = num % base;
		int shang = num / base;
		int[] res = new int[10];
		int i = 0;
		while (shang > 0 || yushu != 0) {
			res[i++] = yushu;
			yushu = shang % base;
			shang = shang / base;
		}
		for (int j = i - 1; j >= 0; j--) {
			result += res[j] + " ";
		}
		if (num == 0) {
			result = "0";
		}
		return result;
	}

}

解题思路：
首先调用toBaseString()方法（除留余数法），得到base进制的字符串，各数字之间以空格隔开。main方法当中得到返回的字符串，然后根据空格转成字符串数组，之后得到整形数组。然后对整形数组进行比较，判断是否为回文。