LeetCode(atoi)实现atoi

最新推荐文章于 2024-07-23 14:04:43 发布

lqcsp

最新推荐文章于 2024-07-23 14:04:43 发布

阅读量671

点赞数

分类专栏： c++ LeetCode 面试题文章标签： leetcode 面试 atoi string

本文链接：https://blog.csdn.net/lqcsp/article/details/23393415

版权

c++ 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode 面试题

73 篇文章 1 订阅

订阅专栏

Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.

Requirements for atoi:

The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.

The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.

If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.

If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.

几点需要注意的细节:

1.需要判断符号。

2.需要判断溢出情况，当溢出的时候输出int型的最大或最小

3.需要处理字符串前面有空格的情况

4.需要处理字符串中间有非数字字符，非数字字符后面的数字抛弃

代码：

class Solution {
public:
    int atoi(const char *str) {
      int len = strlen(str);
      if(len == 0 || str == NULL)
        return 0;
      int begin = 0;
      while(str[begin] == ' ')//将字符串开头的空格过滤掉像"   -123"
        begin++;
      bool is_negative = false;
      if(str[begin] == '-' || str[begin] == '+')//记录数字的符号
      {
        if(str[begin] == '-')
          is_negative = true;
        begin++;
      }
      long long value = 0;
      //开始转化
      for(size_t i = begin; i < len; ++i)
      {
        if(!(str[i] >= '0' && str[i] <= '9'))//当碰到第一个非数字字符的时候结束转换忽略后面的数字
          break;
        value = 10 * value + str[i] - '0';
      }
      if(is_negative)
        value = -value;
      //判断是否越界
      if(value > numeric_limits<int>::max())
        return numeric_limits<int>::max();
      if(value < numeric_limits<int>::min())
        return numeric_limits<int>::min();
      return value;
    }
};