View difference between Paste ID: Aifx4nzJ and sDt5Avfr

 import java.util.Set;
 
 // Quick experiment of the SlidingWindowMap code challenge
 // Author: Thierry Kormann - [email protected]
 //
 public class SlidingWindowMap {
 
     private String[] _keys;
     private int _maxCount;
     private long _periodMs;
 
-    private long[] _times;
+    // Used to store when a key has been used.
-    private int _count;
+    private long[] _keyUsagesMs;
     // An index in _keyUsagesMs to know when a key will be available.
     private int _index;
 
     public SlidingWindowMap(Set<String> keys, int maxCount, long periodMs) {
         _keys = new String[keys.size()];
         keys.toArray(_keys);
-        _times = new long[keys.size() * maxCount];
+
         _periodMs = periodMs;
         _keyUsagesMs = new long[keys.size() * maxCount];
     }
 
     /**
      * @return a key that has been used less than `maxCount` times during the
      * past `periodMs` milliseconds or null if no such key exists.
-        if (_count == _times.length) {
+
-            _count = 0;
+
         if (_index == _keyUsagesMs.length) {
             _index = 0;
-        if (now >= _times[_count] + _periodMs) {
+
-            _times[_count] = now;
+
-            return _keys[_count++ % _keys.length];
+        if (now >= _keyUsagesMs[_index] + _periodMs) {
             _keyUsagesMs[_index] = now;
             return _keys[_index++ % _keys.length];
         }
         return null;
     }
 }