hash
mars2014jia
这个作者很懒,什么都没留下…
展开
-
Implement strStr()
经典BM利用hash 处理的问题, 找substring位置,在haystack里面捞针 ···java public class Solution { public int strStr(String haystack, String needle) { // ref http://zjalgorithm.blogspot.com/2014/12/leetcode转载 2015-03-06 05:10:15 · 148 阅读 · 0 评论 -
难题部分Copy List with Random Pointer
别的都不说,这部分题对我来说,首先就是看不懂题意 A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. /*转载 2015-03-27 05:48:56 · 242 阅读 · 0 评论 -
Clone Graph
Clone Graph lone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquel转载 2015-03-07 05:58:10 · 196 阅读 · 0 评论 -
2sum
ref http://www.cnblogs.com/springfor/p/3859618.html // hash soln public class Solution { public int[] twoSum(int[] numbers, int target) { // hashmap soln if(numbers=转载 2015-03-07 06:57:34 · 248 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
public class Solution { //ref http://blog.csdn.net/linhuanmars/article/details/19949159 很精妙的解法哟 public int lengthOfLongestSubstring(String s) { if(s==null || s.length()<1转载 2015-03-11 04:12:50 · 208 阅读 · 0 评论