Task description A non-empty zero-indexed array A consisting of N integers is given. A triplet (X, Y, Z), such that 0 ≤ X < Y < Z < N, is called a dou ...
分类：
其他好文 时间：
2017-06-12 10:40:49
阅读次数：
208
Task description A non-empty zero-indexed array A consisting of N integers is given. Theproduct of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ...
分类：
其他好文 时间：
2017-04-29 09:45:29
阅读次数：
199
Task description A zero-indexed array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P < Q < R < N and: A[P] + A[Q] > A ...
分类：
其他好文 时间：
2017-04-29 09:41:44
阅读次数：
242
一篇讲Person Re-ID的论文，与人脸识别(认证)有很多相通的地方。 《In Defense of the Triplet Loss for Person Re-Identification》
分类：
其他好文 时间：
2017-04-12 04:46:36
阅读次数：
451
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm ...
分类：
其他好文 时间：
2017-03-12 10:55:12
阅读次数：
134
Assume you have an array of length n initialized with all 0's and are given k update operations. Each operation is represented as a triplet: [startInd ...
分类：
其他好文 时间：
2017-02-17 11:53:31
阅读次数：
144
problem 9：Special Pythagorean triplet 题意：若a+b+c=1000，且a2+b2=c2，求abc 代码如下： ...
分类：
其他好文 时间：
2017-01-17 20:03:16
阅读次数：
169
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm ...
分类：
其他好文 时间：
2016-12-01 09:25:51
阅读次数：
128
Naive Solution: use DP, Time O(N^2), Space O(N) dp[i] represents the length of longest increasing subsequence till i including element i in nums array ...
分类：
其他好文 时间：
2016-11-23 08:13:25
阅读次数：
117
Assume you have an array of length n initialized with all 0's and are given k update operations. Each operation is represented as a triplet: [startInd ...
分类：
其他好文 时间：
2016-11-20 07:07:19
阅读次数：
186
