Clone 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 u...
分类：
编程语言 时间：
2015-06-02 12:56:58
阅读次数：
175
Time Limit Exceeded/*Contains Duplicate II Given an array of integers and an integer k, find out whether there there are two distinct indices i and j....
分类：
其他好文 时间：
2015-06-02 12:54:18
阅读次数：
88
题目：
Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in
the array such that the difference between nums[i] and nums[j] is
at mo...
分类：
其他好文 时间：
2015-06-02 11:21:48
阅读次数：
90
A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
1/2
=
0.5
1/3
=
0.(3)
1/4
=
0.25
1/5...
分类：
其他好文 时间：
2015-06-02 11:18:53
阅读次数：
125
The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie...
分类：
其他好文 时间：
2015-06-02 10:41:32
阅读次数：
102
LeetCode Contains Duplicate II题目思路跟Contains Duplicate一模一样，加个坐标判断即可。代码bool containsNearbyDuplicate(int* nums, int numsSize, int k) {
if (numsSize <= 1) return false;
int length = 100007;
if...
分类：
其他好文 时间：
2015-06-02 09:22:08
阅读次数：
111
leetcode 220: Contains Duplicate III
java c++ python...
分类：
其他好文 时间：
2015-06-02 09:20:30
阅读次数：
133
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] ...
分类：
其他好文 时间：
2015-06-02 01:37:36
阅读次数：
111
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-06-01 13:23:32
阅读次数：
112
Given an array of integers and an integer k, find out whether there there are two distinct indices
i and j in the array such that nums[i] = nums[j] and the difference between
i and j is at most k.
...
分类：
其他好文 时间：
2015-06-01 11:40:05
阅读次数：
148
