From 劍指Offer 何海濤 著

#include <iostream> #include <string>
#include <cctype>bool g_valid = false;int StrToInt(const std::string& s) {long long res = 0ll;int n = s.size();int i= 0;g_valid = true;while(i<n && s[i] == ' ') {i++;}bool isNegative = false;if(s[i] == '-') {isNegative = true;i++;} else if(s[i] == '+') {i++;}if(i== n) {g_valid = false;return res;}while(i<n && isdigit(s[i])) {res *= 10;res += s[i] - '0';i++;if(!isNegative && res > (long)0x7fffffff || isNegative&& -res < (long)0x80000000) {g_valid = false;return 0;}}if(i< n) {g_valid = false;return 0;}return isNegative ? -res : res; }

測試集:

void test(const std::string &s, int n, bool valid) {std::cout << std::boolalpha<< (StrToInt(s) == n && valid == g_valid) << std::endl; }int main(int argc, char* argv[]) {test("", 0, false);test(" ", 0, false);test("+", 0, false);test("-", 0, false);test("123", 123, true);test("+0", 0, true);test("-0", 0, true);test("+123", 123, true);test("-123", -123, true);test("abc", 0, false);test("1a33", 0, false);//有效的最大正整數, 0x7FFFFFFFtest("+2147483647", 2147483647, true);test("+2147483648", 0, false);//有效的最小負整數, 0x80000000test("-2147483648", -2147483648, true);test("-2147483649", 0, false);return 0; }

?

轉載于:https://www.cnblogs.com/long3216/p/4438234.html

總結

以上是生活随笔為你收集整理的{面试题49} 把字符串转换成整数的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。