题目

题目很简单，就是写一个函数把string转换成int，但是通过率只有可怜的11%，难点是要考虑所有情况，特别是int溢出边界，反正我是写了2个小时还没解决，先放到这，有空接着搞，现在应该还有最后一个bug。

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.

代码

public class Solution {public int atoi(String str) {String num_str="";char[] str_char=str.toCharArray();char[] sympo="-+".toCharArray();boolean abs=true;for(int i=0;i<str.length();i++){if(str_char[i]==sympo[0] ||str_char[i]==sympo[1]){if(!Character.isDigit(str_char[i+1])){return 0;}if(str_char[i]==sympo[0]){abs=false;}}if(Character.isDigit(str_char[i])){              num_str+=String.valueOf(str_char[i]);             }else{if(num_str.length()!=0){break;}}
//            if(Character.isDigit(str_char[i])){
//               num_str+=String.valueOf(str_char[i]);
//              }if(num_str!=""){if(Math.abs(Integer.parseInt(num_str))>=Integer.MAX_VALUE / 10){return Integer.MAX_VALUE;}}}if(num_str!=""){if(abs){return Integer.parseInt(num_str);}else{return -Integer.parseInt(num_str);}}else{return 0;}}}

代码下载：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文来自博客 “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/

【LeetCode从零单排】No.8 String to Integer (丧心病狂的一道题）相关推荐

【LeetCode从零单排】No.7 Reverse Integer
前话今天开始励志刷一下leetcode上面的题目(还好这个网站没被TG和谐).从easy的开始,数一下差不多有40道,争取两个月搞定. 题目没想到做的第一道题目,虽然看似 ...
【LeetCode从零单排】No198.House Robber No91.Decode Ways139 word break（动态规划典型应用）
1.题目一道典型的Dynamic Programming的题目. You are a professional robber planning to rob houses along a stree ...
【LeetCode从零单排】No70.ClimbingStairs
题目爬楼梯问题,这是一道很有趣的问题.首先看题目: You are climbing a stair case. It takes n steps to reach to the top. Each ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
【LeetCode从零单排】No 3 Longest Substring Without Repeating Characters
题目 Given a string, find the length of the longest substring without repeating characters. For exampl ...
【LeetCode从零单排】No189 .Rotate Array
题目 Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the arr ...
【LeetCode从零单排】No67.AddBinary
题目 Given two binary strings, return their sum (also a binary string). For example, a = "11" ...
【LeetCode从零单排】No58.Length of Last Word
题目 Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return th ...
【LeetCode从零单排】No38.CountAndSay
题目 The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111 ...

【LeetCode从零单排】No.8 String to Integer (丧心病狂的一道题）

题目

代码

【LeetCode从零单排】No.8 String to Integer (丧心病狂的一道题）相关推荐

最新文章

热门文章