Java Solution (Sorting)


  • 0
    S

    """

        public class Solution {
        
       public boolean containsDuplicate(int[] nums) {
        
        Arrays.sort(nums);
        
        for(int i = 0 ; i<nums.length-1 ; i++){
            
            if(nums[i]==nums[i+1]) return true;
        }
        
        return false;
        
    }
    

    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.