前缀
文章平均质量分 75
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 179. Largest Number(最大数)
原题网址:https://leetcode.com/problems/largest-number/ Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest原创 2016-05-25 01:36:20 · 1877 阅读 · 0 评论 -
LeetCode 201. Bitwise AND of Numbers Range(范围内所有数值的比特与)
原题网址:https://leetcode.com/problems/bitwise-and-of-numbers-range/ Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4. 思路:总体思路就是求出m和n的高位比特的公共前缀。 方法一:变动前缀本身。原创 2016-05-04 05:21:07 · 421 阅读 · 0 评论 -
LeetCode 13. Roman to Integer(罗马数字转阿拉伯数字)
原题网址:https://leetcode.com/problems/roman-to-integer/ Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 方法:理解罗马数字。 public class Solut原创 2016-05-19 05:33:26 · 681 阅读 · 0 评论 -
LeetCode 14. Longest Common Prefix(最长公共前缀)
原题网址:https://leetcode.com/problems/longest-common-prefix/ Write a function to find the longest common prefix string amongst an array of strings. 方法一:暴力求解。 public class Solution { public Strin原创 2016-05-19 05:51:55 · 692 阅读 · 0 评论 -
LeetCode 214. Shortest Palindrome(最短回文)
原题网址:https://leetcode.com/problems/shortest-palindrome/ Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrom原创 2016-05-06 02:42:12 · 1239 阅读 · 0 评论 -
LeetCode 28. Implement strStr()(实现子串定位)
原题网址:https://leetcode.com/problems/implement-strstr/ Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 方法:KMP算法。 p原创 2016-05-20 10:35:48 · 822 阅读 · 0 评论