219. Contains Duplicate II - LeetCode

Description:

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true

Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

Accepted

217,171

Submissions

603,318

Solution:

 

 

class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        
        //special case
        
        if(nums==null||nums.length ==0){
            return false; 
        }
        
        for(int i = 0; i<nums.length; i++){
            int count = 0; 
            
            for(int  j = i+1; count< k&&j<nums.length ; count++, j++){
                
                
                if(nums[i]== nums[j]){
                    
                    //System.out.println(" i = "+i+" j = "+j);
                    
                    return true;
                }
                   
            }
            
        }

        return false; 
        
    }
}