Math
文章平均质量分 64
豆腐脑是咸的
这个作者很懒,什么都没留下…
展开
-
Multiply Strings (Java)
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.先把每一位乘出来的数存起来,然后再集体处理进位。Source原创 2015-01-08 22:36:10 · 877 阅读 · 0 评论 -
Valid Number (Java)
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-02-12 14:42:02 · 486 阅读 · 0 评论 -
Max Points on a Line (Java)
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.用斜率算,遍历每一个点,然后以这个点和剩下的所有点连线,斜率相同的放在hash的同一位置。如果有和这个点相同的点统计下来最后算进去。Source public int maxPoi原创 2015-02-12 14:04:17 · 418 阅读 · 0 评论 -
Pow(x, n) (Java)
Implement pow(x, n).注意n为负数的情况Sourcepublic class Solution { public double pow(double x, int n) { if(n == 0) return 1; if(n < 0){ n = -n; x = 1 / x;原创 2015-01-05 19:40:28 · 355 阅读 · 0 评论 -
Sqrt(x) (Java)
Implement int sqrt(int x).Compute and return the square root of x.用二分法来查找,x的根肯定是大于0小于x的,mid作为x的根,用mid * mid与x比大小,然后接着查找,如果有则返回,不能开尽的用较小的整数代替(根向下取整)。Sourcepublic class Solution { pu原创 2015-01-05 16:16:02 · 449 阅读 · 0 评论 -
Fraction to Recurring Decimal (Java)
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating, enclose the repeating part in parentheses.原创 2015-01-23 10:20:01 · 458 阅读 · 0 评论 -
Divide Two Integers (Java)
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.这道题题意是算余数不能用乘、除和取模运算。循环减会超时。可以采用位运算,下次写注意下。这道题主要在对于边界的处理上,-2147483648,原创 2015-01-22 10:44:04 · 394 阅读 · 0 评论 -
Integer to Roman (Java)
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.罗马数字 I(1)、V(5)、X(10)、L(50)、C(100)、D(500)、M(1000)罗马数字是左减右加只需记住罗马数字转为整型数字的减操作注意事项:原创 2015-01-20 22:01:07 · 251 阅读 · 0 评论 -
Excel Sheet Column Number (Java)
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...原创 2014-12-31 21:01:18 · 572 阅读 · 0 评论 -
Add Binary (Java)
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".Sourcepublic class Solution { public String addBinary(String a, St原创 2014-12-26 10:41:48 · 446 阅读 · 0 评论 -
Reverse Integer (Java)
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Source原创 2014-10-15 16:30:42 · 424 阅读 · 0 评论 -
Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB S原创 2014-12-21 21:38:28 · 357 阅读 · 0 评论 -
Add Two Numbers (Java)
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2014-12-26 18:15:47 · 442 阅读 · 0 评论 -
Roman to Integer (Java)
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.原创 2014-10-16 19:56:51 · 494 阅读 · 0 评论 -
String to Integer (atoi) (Java)
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原创 2014-10-15 21:27:12 · 708 阅读 · 0 评论 -
Palindrome Number (Java)
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin原创 2014-10-16 10:28:16 · 299 阅读 · 0 评论 -
Factorial Trailing Zeroes (Java)
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.题目大意是说找出n!算出的数末尾有多少个零。找末尾零就相当于找从1到n中有多少个2和5,如果用for(i = 1; i原创 2015-01-09 11:31:25 · 356 阅读 · 0 评论 -
Permutation Sequence (Java)
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-01-08 16:25:40 · 418 阅读 · 0 评论 -
Plus One (Java)
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.Sourcepublic cla原创 2014-12-26 11:27:17 · 446 阅读 · 0 评论