前言: 对比下文给出的各种解法
解法1:不加任何高级库函数,我愿称之为朴实无华的农民版:
#include<iostream>
using namespace std;
int main()
{
void heidong(int arr[]);
int n = 0;
cin >> n;
int arr[4];
int a = 0;
if (n > 999)
{
int tmp = 1000;
for (int i = 0; i < 4; i++)
{
arr[i] = n / tmp;
n %= tmp;
tmp /= 10;
}
}
else if (n > 99)
{
int tmp = 100;
arr[0] = 0;
for (int i = 1; i < 4; i++)
{
arr[i] = n / tmp;
n %= tmp;
tmp /= 10;
}
}
else if (n > 9)
{
arr[0] = 0;
arr[1] = 0;
arr[2] = n / 10;
arr[3] = n % 10;
}
else
{
arr[0] = arr[1] = arr[2] = 0;
arr[3] = n;
}
if (arr[0] == arr[1] && arr[1] == arr[2] && arr[2] == arr