今天的两道题关于基本数据类型的探讨,估计也是要考虑各种情况,要细致学习

7. Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321 Example2: x = -123, return -321

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Update (2014-11-10): Test cases had been added to test the overflow behavior.

注:颠倒整数中的每一位,符号位保留。估计会有一些极端情况需要考虑,这里指出了几个,如,末位为0 翻转之后是什么?又如,如果翻转之后超出了数据类型的表达范围怎么办?。。。可能还会遇到其它的困难^~^

解:在考虑最值的时候必须另外定义最值为int 常量,否则的话系统会给他分配一个合适的类型

直接写成这个做判断是不可以的。

if (temp >0x7fffffff || temp < 0x80000000)
{
return result;
}

下面是提交通过的代码:

class Solution {
public:
int reverse(int x) {
int result{0};
long long temp{0};
const int max_int=0x7fffffff;// 0111 1111 1111 1111 ... 1111 32bit
const int min_int=0x80000000;//1000 0000 0000 0000 ... 0000 32bit while (x != 0)
{
temp = temp*10 + x%10;
x = x / 10;
if (temp > max_int || temp < min_int)
{
return result;
}
}
result = temp;
return result;
}
};

8. String to Integer (atoi)

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.

Update (2015-02-10): The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button  to reset your code definition.

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.

注:把一个字符串转换为整数。要考虑所有可能的输入情况。这个问题在《c++入门经典》中设计计算器时遇到过,只是当时没有细细的分析每一种情况,现在要好好看看。

解:这个简直是不可理喻,一下列举了一些可能出现的情况

input:“+ - 2”expected:0

input:“+ 01   1 2”expected:1

input:“+ + 2”expected:0

input:“-012a34”expected:12

input:"    +11191657170"expected:2147483647

代码如下,有待精简:

long long  result{ 0 };
int n{ 0 };//位数
int sign{ 1 }, p_n_flag{ 0 }, zero_flag{0};
for (string::iterator s_i = str.begin(); s_i != str.end(); s_i++)
{
if (*s_i == '-')
{
if (p_n_flag==0)
{
p_n_flag = 1;
sign = -1;
continue;
}
else
{
sign = 0;//如果出现两次被认为是非法输入
break;
}
}
if (*s_i == '+')
{
if (p_n_flag == 0)
{
p_n_flag = 1;
sign = 1;
continue;
}
else
{
sign = 0;
break;
}
}
if (*s_i == ' ')
{
if (n == 0 && zero_flag == 0 && p_n_flag==0)
{ continue; }
else
{break;}
}
if (*s_i == '0')
{
zero_flag = 1;
if (n == 0)
{continue;}
else
{
n = n + 1;
result = result * 10;
if (result > INT_MAX)
{ switch (sign)
{
case 0:return 0;
case 1:return INT_MAX;
case -1:return INT_MIN;
default:
break;
}
}
else
{continue;} }
}
if ((*s_i) > '0' && ((*s_i) < '9' || (*s_i) == '9'))
{
n = n + 1;
//result = result * 10 + ((*s_i) - 48);
result = result * 10 + ((*s_i) - '0');//最后一个括号里不用显式的值48 而是用‘0’
cout << result << endl;
if (result > INT_MAX)
{ switch (sign)
{
case 0:return 0;
case 1:return INT_MAX;
case -1:return INT_MIN;
default:
break;
}
}
}
else
{
break;
} }
result = result*sign; return result;

Leetcode 题目整理-2 Reverse Integer && String to Integer的更多相关文章

  1. Leetcode 题目整理-3 Palindrome Number & Roman to Integer

    9. Palindrome Number Determine whether an integer is a palindrome. Do this without extra space. clic ...

  2. 【LeetCode算法题库】Day3:Reverse Integer & String to Integer (atoi) & Palindrome Number

    [Q7]  把数倒过来 Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Outpu ...

  3. 【LeetCode】7 & 8 - Reverse Integer & String to Integer (atoi)

    7 - Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 Notic ...

  4. LeetCode 8. 字符串转换整数 (atoi)(String to Integer (atoi))

    8. 字符串转换整数 (atoi) 8. String to Integer (atoi) 题目描述 LeetCode LeetCode8. String to Integer (atoi)中等 Ja ...

  5. LeetCode.8-字符串转整数(String to Integer (atoi))

    这是悦乐书的第349次更新,第374篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Medium级别的第4题(顺位题号是8).实现将字符串转换为整数的atoi方法. 该函数首先去掉所需丢 ...

  6. Leetcode 题目整理 climbing stairs

    You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...

  7. Leetcode 题目整理-8 Count and Say

    38. Count and Say The count-and-say sequence is the sequence of integers beginning as follows: 1, 11 ...

  8. Leetcode 题目整理-1

    1. Two Sum Given an array of integers, return indices of the two numbers such that they add up to a ...

  9. 【leetcode题目整理】数组中找子集

    368. Largest Divisible Subset 题意:找到所有元素都不同的数组中满足以下规则的最大子集,规则为:子集中的任意两个元素a和b,满足a%b=0或者b%a=0. 解答:利用动态规 ...

随机推荐

  1. DEVOPS技术实践_04:Jenkins参数化构建

    一.参数化构建 1.1 各个参数的信息 凭据参数存储一个用户的账号密码信息,等等,运用最多的是选项参数 1.2 使用选项参数 构建已经变成参数化构建 1.3 获取这个值,修改Jenkinsfile文件 ...

  2. 【温故知新】Java web 开发(四)JSTL 与 JDBC 的增删改查

    本篇开始使用 jstl 这个 jsp 的标签库,在同一个 Servlet 中实现处理 CRUD 请求,以及使用 jdbc 数据库基本操作.然后你会发现 Servlet 和 jdbc 还是有很多不方便之 ...

  3. Asp.net导入Excel并读取数据

    protected void Button1_Click(object sender, EventArgs e) { if (station.HasFile == false)//HasFile用来检 ...

  4. tomcat日志传参乱码问题

    问题:      在centos系统下,tomcat8.0.36控制台日志打印会出现中文乱码. 解决方案:      在catalina.sh里加上 JAVA_OPTS="-Dfile.en ...

  5. Spring Boot 配置文件中使用变量、使用随机数

    参数引用 在application.properties中的各个参数之间可以直接通过是使用placeHolder的方式进行引用,如: book.author=Clark book.name=C++ b ...

  6. Java异常处理原则与技巧总结

    一  处理原则 Java异常代码中我们使用异常的目的是让异常的异常类型来提示“什么”被抛出了--- 即出了什么问题:用异常的栈打印信息来跟踪异常在“哪里”抛出 --- 即哪里出了问题: 异常提示信息来 ...

  7. 「CF670C」Cinema 解题报告

    题面 传送门 思路: 离散化.hash 对于这样一个明显的统计排序的题目,当然轻而易举啦~ 但是!看!语言的编号 a数组和 b数组的值最大在\(10^9\)的级别,所以开个数组来存---That's ...

  8. 我与Git的那些破事--代码管理实践

    1. Git是什么? 作为一名程序猿,我相信大家都或多或少接触过git--分布式版本控制软件. 有人说,它是目前世界上最先进的分布式版本控制系统,我想说,是否最先进不知道,但确实好用,实用. 作为一款 ...

  9. 个人博客-vue-blog

    http://47.100.126.169/zmengBlog/

  10. 2017CCPC杭州(ABCDJ)

    所有的题目在这里<--- 待补... Problem A. HDU6264:Super-palindrome 题意: 题目定义了一个超级回文串,这个串满足:它的任一奇数长度的串都是回文串. 现在 ...