Hash
crazy__chen
只要有一个人爱我,懂我,愿意等我,我便勇往直前,无所不能。
展开
-
leetcode--Shortest Word Distance II
This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parameters. How would yo原创 2015-08-22 15:32:35 · 3014 阅读 · 0 评论 -
leetcode--Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indicesi and j in the array such that nums[i] = nums[j] and the difference betweeni and j is at most k.pu原创 2015-06-06 15:27:55 · 912 阅读 · 0 评论 -
leetcode--Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2015-06-06 14:55:35 · 936 阅读 · 0 评论 -
leetcode--Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where原创 2015-05-02 20:08:07 · 1105 阅读 · 0 评论 -
剑指offer--复杂链表的复制
题目描述输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点)。/*public class RandomListNode { int label; RandomListNode next = null; RandomListNode random = null; RandomListNode(i原创 2015-04-11 22:13:49 · 1224 阅读 · 0 评论