前言
本文介绍了 LeetCode 第 8 题 , “String to Integer (atoi)”, 也就是 “字符串转换整数 (atoi)” 的问题.
本文使用 C# 语言完成题目,介绍了2种方法供大家参考。 其中 方法二 参考了官方解法,并进行了一定程度的优化。
题目
English
LeetCode 8. String to Integer (atoi)
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: [−2^31, 2^(31 − 1) ]. If the numerical value is out of the range of representable values, INT_MAX (2^(31 − 1) ) or INT_MIN (−2^31) 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
Expl

本文详细介绍了LeetCode第8题“字符串转换整数 (atoi)”的C#解决方案,包括两种方法:一种是常规的代码实现,另一种是基于DFA(确定有穷自动机)的优化方法。文章提供了执行结果和复杂度分析。
最低0.47元/天 解锁文章
79

被折叠的 条评论
为什么被折叠?



