13. Roman to Integer
摘要:Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 字符串的是从左边开始的 res,p 是元组
阅读全文
posted @
2017-02-28 21:48
Ci_pea
阅读(120)
推荐(0)
9. Palindrome Number
摘要:Determine whether an integer is a palindrome(回文). Do this without extra space.
阅读全文
posted @
2017-02-28 19:40
Ci_pea
阅读(147)
推荐(0)
7. Reverse Integer
摘要:Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 Note:The input is assumed to be a 32-bit signed integer. Yo
阅读全文
posted @
2017-02-27 20:41
Ci_pea
阅读(104)
推荐(0)
1. Two Sum
摘要:Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex
阅读全文
posted @
2017-02-27 19:33
Ci_pea
阅读(117)
推荐(0)