package question;

import java.util.HashMap;
import java.util.Map;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question697 {
 public static void main(String[] args) {
 System.out.println(new Question697().findShortestSubArray(new int[]{2, 1}));
 }
 public int findShortestSubArray(int[] nums) {
 Map<Integer, P> map = new HashMap<>();
 int max=0;
 for (int i = 0; i < nums.length; i++) {
 if (map.containsKey(nums[i])) {
 P p = map.get(nums[i]);
 p.cnt++;
 p.last=i;
 } else {
 map.put(nums[i], new P(1, i, i));
 }
 max=Math.max(max, map.get(nums[i]).cnt);
 }
 int res=Integer.MAX_VALUE;
 for (P p : map.values()) {
 if (p.cnt==max) {
 res=Math.min(p.last-p.first+1, res);
 }
 }
 return res;
 }

 private static class P {
 int cnt, first, last;

 public P(int cnt, int first, int last) {
 this.cnt = cnt;
 this.first = first;
 this.last = last;
 }
 }
}