最近的回文数

题目描述
输入一个整数，找到与它的差的绝对值最小的回文数。当有两个解时，取较小的那一个解。

输入
输入为一行，包括一个整数 N ，整数 N 的长度在 1 到1000 之间（含 1000 ）。

输出
输出只有一个整数，为与输入数字的差的绝对值最小的回文数。

样例输入1
10000
样例输出1
9999
样例输入2
1199
样例输出2
1221
样例输入3
1234321
样例输出3
1234321

#include<iostream>
#include<string>
using namespace std;
string num, num1, num2, num3;
int c1() {
	for (int i = 0, j = num.size() - 1; i <= j; i++, j--) {
		if (num[i] != num[j])
			return 0;
	}
	return 1;
}
int c2() {
	if (num[0] != '1') return 0;
	for (int i = 1; i <= num.size() - 1; i++) {
		if (num[i] != '0') return 0;
	}
	return 1;
}
void make2(string &num) {
	for (int i = 0,j = num.size() - 1; i < j; i++, j--) {
		num[j] = num[i];
	}
}
void make1() {
	int mid = (num1.size() + 1) / 2 - 1;
	num1[mid] -= 1;
	for (int i = mid; i >= 0; i--) {
		if (num1[i] < '0') {
			num1[i - 1] -= 1;
			num1[i] += 10;
		}
	}
	make2(num1);
}
void make3() {
	int mid = (num3.size() + 1) / 2 - 1;
	num3[mid] += 1;
	for (int i = mid; i >= 0; i--) {
		if (num3[i] > '9') {
			num3[i - 1] += 1;
			num3[i] -= 10;
		}
	}
	make2(num3);
}
void f(string s1,string s2) {
	string min_num, max_num;
	min_num = max_num = num;
	for (int i = 0; i < num.size(); i++) {
		min_num[i] = max_num[i] = '0';
	}
	for (int i = num.size() - 1; i >= 0; i--) {
		min_num[i] = num[i] - s1[i];
		max_num[i] = s2[i] - num[i];
	}
	for (int i = num.size() - 1; i >= 0; i--) {
		if (min_num[i] < '0') {
			min_num[i - 1] -= 1;
			min_num[i] += 10;
		}
		if (max_num[i] < '0') {
			max_num[i - 1] -= 1;
			max_num[i] += 10;
		}
	}
	if (max_num < min_num) {
		cout << s2 << endl;
	}
	else {
		cout << s1 << endl;
	}

}
int main() {
	cin >> num;
	if (c1()) { //判断是否是回文数
		cout << num << endl;
		return 0;
	}
	if (c2()) { //判断是否为100..00
		for (int i = 1; i < num.size(); i++) {
			cout << 9;
		}
		return 0;
	}
	num1 = num2 = num3 = num;
	make2(num2); //根据数的前一半构造回文数
	int flag = 0;
	if (num2 < num) {
		make3(); //如果构造出来的数字小于原来的数，前一半数字+1 例如：num=23456,num2=23443
		flag = 1;
	}
	else {
		make1();
	}
	if (flag == 1) {//num2 num3 作差
		string min_num, max_num;
		min_num = max_num = num;
		for (int i = 0; i < num.size(); i++) {
			min_num[i] = max_num[i] = '0';
		}
		for (int i = num.size() - 1; i >= 0; i--) {
			min_num[i] = num[i] - num2[i]+'0';
			max_num[i] = num3[i] - num[i]+'0';
		}
		for (int i = num.size() - 1; i > 0; i--) {
			if (min_num[i] < '0') {
				min_num[i - 1] -= 1;
				min_num[i] += 10;
			}
			if (max_num[i] < '0') {
				max_num[i - 1] -= 1;
				max_num[i] += 10;
			}
		}
		if (max_num < min_num) {
			cout << num3 << endl;
		}
		else {
			cout << num2 << endl;
		}
	}
	else { //num1 num2作差
		string min_num, max_num;
		min_num = max_num = num;
		for (int i = 0; i < num.size(); i++) {
			min_num[i] = max_num[i] = '0';
		}
		for (int i = num.size() - 1; i >= 0; i--) {
			min_num[i] = num[i] - num1[i]+'0';
			max_num[i] = num2[i] - num[i]+'0';
		}
		for (int i = num.size() - 1; i > 0; i--) {
			if (min_num[i] < '0') {
				min_num[i - 1] -= 1;
				min_num[i] += 10;
			}
			if (max_num[i] < '0') {
				max_num[i - 1] -= 1;
				max_num[i] += 10;
			}
		}
		if (max_num < min_num) {
			cout << num2 << endl;
		}
		else {
			cout << num1 << endl;
		}
	}
	return 0;
}