zoukankan      html  css  js  c++  java
  • leetcode8 String to Integer

    题目描述

    Implement atoi which converts a string to an integer.

    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.

    Note:

    Only the space character ' ' is considered as whitespace character.
    Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.
    Example 1:

    Input: "42"
    Output: 42
    Example 2:

    Input: " -42"
    Output: -42
    Explanation: The first non-whitespace character is '-', which is the minus sign.
      Then take as many numerical digits as possible, which gets 42.
    Example 3:

    Input: "4193 with words"
    Output: 4193
    Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.
    Example 4:

    Input: "words and 987"
    Output: 0
    Explanation: The first non-whitespace character is 'w', which is not a numerical
      digit or a +/- sign. Therefore no valid conversion could be performed.
    Example 5:

    Input: "-91283472332"
    Output: -2147483648
    Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
      Thefore INT_MIN (−231) is returned.

    我的解法

    class Solution {
    public:
        int myAtoi(string str) {
            int notfirst=0;
            int fuhao=1;
            long long int result=0;
            for(char s:str){
                if(s==' '&&notfirst==1)
                    break;
               if(s==' ')
                   continue;
    
                if(notfirst&&(s<'0'||s>'9'))
                    break;
               if(s=='-')
               {
                   fuhao=-1;
                   notfirst=1;
                   continue;
               }
                if(s=='+')
                {
                    fuhao=1;
                    notfirst=1;
                    continue;
                }
                if(s<'0'||s>'9')
                    break;
                else if(s>='0'&&s<='9')
                {
                    notfirst=1;
                    result=result*10+s-'0';
                    if(result>INT_MAX && fuhao==1)
                        return INT_MAX;
                    else if(result>INT_MAX && fuhao==-1)
                        return INT_MIN;
                    else if(fuhao ==1 && result <INT_MIN){
                        return INT_MIN;
                    }else if(fuhao==-1 && result< INT_MIN){
                        return INT_MAX;
                    }
                }
            }
            result=result * fuhao;
            return result;
        }
    };
    

    总结

        我发现思路很容易出来,但是编写的时候总是会漏掉各种情况。这种有点像csp的第三题大模拟,不过需要自己想特殊情况的处理。

  • 相关阅读:
    STL 算法 std::min
    SAP UI5 初学者教程之五:视图控制器初探 试读版
    SAP UI5 的初始化过程
    Angular 应用里的摇树优化
    Angular 应用里的 vendor.js 是用来干什么的?
    SAP UI5 初学者教程之四:XML 视图初探试读版
    SAP UI5 初学者教程之三:开始接触第一个 SAP UI5 控件 试读版
    SAP UI5 初学者教程之二:SAP UI5 的引导过程(Bootstrap) 试读版
    SAP UI5 初学者教程之一:Hello World 试读版
    SAP UI5 初学者教程的学习目录
  • 原文地址:https://www.cnblogs.com/HaoPengZhang/p/11443556.html
Copyright © 2011-2022 走看看