题目地址:
https://www.lintcode.com/problem/shortest-duplicate-subarray/description
给定一个数组 A A A,返回其包含重复数字的最短子数组的长度。
用哈希表记录一下每个数字最新的出现位置即可。代码如下:
import java.util.HashMap;
import java.util.Map;
public class Solution {
/**
* @param A: The array you should find shortest subarray length which has duplicate elements.
* @return: Return the shortest subarray length which has duplicate elements.
*/
public int getLength(int[] A) {
// Write your code here.
Map<Integer, Integer> map = new HashMap<>();
int res = A.length + 1;
for (int i = 0; i < A.length; i++) {
if (map.containsKey(A[i])) {
res = Math.min(res, i - map.get(A[i]) + 1);
}
map.put(A[i], i);
}
return res <= A.length ? res : -1;
}
}
时空复杂度 O ( l A ) O(l_A) O(lA)。