math
文章平均质量分 56
NoooName
这个作者很懒,什么都没留下…
展开
-
[Leetcode]Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.把给定的罗马数字转成阿拉伯数字~先科普一下,罗马数字对于每个位有三个单位:1,5,10,对于1到9,表示方法如下:1-3:用1表示;4:1:5左边加一个1;5: 直接用原创 2015-02-02 22:39:07 · 276 阅读 · 0 评论 -
[Leetcode]Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for you原创 2015-02-04 14:21:23 · 298 阅读 · 0 评论 -
[Leetcode]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 ca原创 2015-02-10 13:46:43 · 286 阅读 · 0 评论 -
[Leetcode]Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, no原创 2015-02-09 22:11:49 · 497 阅读 · 0 评论 -
[Leetcode]Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".两个二进制数相加~ 做法和Add Two Numbers类似~从低位开始,一直相加并且维护进位~时间复杂度为O(max(m, n))~细节注意点:用list原创 2015-02-10 15:17:09 · 498 阅读 · 0 评论 -
[Leetcode]Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3原创 2015-02-11 14:55:16 · 352 阅读 · 0 评论 -
[Leetcode]Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo原创 2015-03-17 13:59:57 · 503 阅读 · 0 评论 -
[Leetcode]Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.大数乘法~依旧是从低位到高位进行运算,可以先把num1, num2反转以方原创 2015-03-13 04:28:45 · 329 阅读 · 0 评论 -
[Leetcode]Pow(x, n)
Implement pow(x, n).用二分法~把x的n次方划分成两个x的n/2次方相乘,然后递归求解~注意n为负数的情况~代码复杂度为O(logn)~ 还可以加上越界的判断~class Solution: # @param x, a float # @param n, a integer # @return a float def pow(self,原创 2015-03-14 01:55:26 · 981 阅读 · 0 评论