【蓝桥杯】BASIC-8 回文数

#include <bits/stdc++.h>
using namespace std;

bool isHW1(int n)   //通过翻转字符串来判断一个数是不是回文数
{
    //这种方法codeblocks自测没问题但是提交之后会编译器报错
    //to_string() was not declared in this scope
	string str = to_string(n);
	string temp = str;
	reverse(str.begin(),str.end());
	return str == temp;
}

bool isHW2(int n)   //
{
    int temp = n, m = 0;
    while(temp > 0)
    {
        m = m*10 + temp%10;
        temp /= 10;
    }
    return m == n;
}

//方法三、用栈的“先进后出”求解

int main()
{
	for(int i = 1000; i < 10000; i++)
	{
		if(isHW2(i))
		{
			cout << i << endl;
		}
	}
	return 0;
}