leetcode 7.整数反转

练习地址:力扣

思路:转换成字符串进行暴力对比，注意翻转过来之后可能会超过数的范围，所以要注意提前判断溢出

c++实现:

 

class Solution {
public:
    int reverse(int x) {
	string str = to_string(x);
	int len = str.length();
	char res[35] = {'a'}, idx = 0;
	if (str[0] == '-')
	{
		res[0] = str[0]; idx++;
	}
	while ((len-1)>=0&&str[len-1] != '-')
	{
		res[idx++] = str[len-1];
		len--;
	}
	long int nums = atol(res);
	if (nums >= -2147483648&&nums <= 2147483647) return nums;
	else  return 0;
    }
};