airforce

2015年9月4日

摘要： Problem:Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get ... 阅读全文

posted @ 2015-09-04 08:53 airforce 阅读(334) 评论(0) 推荐(0)

[LeetCode#241]Different Ways to Add Parentheses

摘要： Problem:Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and opera... 阅读全文

posted @ 2015-09-04 01:49 airforce 阅读(167) 评论(0) 推荐(0)

[LeetCode#274]H-Index

摘要： Problem:Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.Ac... 阅读全文

posted @ 2015-09-04 00:53 airforce 阅读(565) 评论(0) 推荐(0)

2015年9月3日

[LeetCode#150]Evaluate Reverse Polish Notation

摘要： Problem:Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another... 阅读全文

posted @ 2015-09-03 10:21 airforce 阅读(156) 评论(0) 推荐(0)

[LeetCode#116]Fraction to Recurring Decimal

摘要： Problem:Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is re... 阅读全文

posted @ 2015-09-03 09:36 airforce 阅读(198) 评论(0) 推荐(0)

[LeetCode#71]Simplify Path

摘要： Problem:Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"Analysis:This pr... 阅读全文

posted @ 2015-09-03 03:50 airforce 阅读(174) 评论(0) 推荐(0)

[LeetCode#43]Multiply Strings

摘要： Problem:Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are ... 阅读全文

posted @ 2015-09-03 01:34 airforce 阅读(164) 评论(0) 推荐(0)

2015年9月2日

[LeetCode#201] Bitwise AND of Numbers Range

摘要： Problem:Given a range [m, n] where 0 00111010101011...We can we reach the '1' in high index, all digits behind after it must change once. That's to s... 阅读全文

posted @ 2015-09-02 23:17 airforce 阅读(164) 评论(0) 推荐(0)

[LeetCode#202] Roman to Integer

摘要： Problem:Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive... 阅读全文

posted @ 2015-09-02 12:30 airforce 阅读(116) 评论(0) 推荐(0)

[LeetCode#12] Roman to Integer

摘要： Problem:Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Analysis:This problem is trivial, if... 阅读全文

posted @ 2015-09-02 11:33 airforce 阅读(133) 评论(0) 推荐(0)

公告