Sort the array to find duplicate (Simple)


  • -11
    C
    //I sorted the numbers first and then found if any two adjacent numbers exist in the sorted array.
    
    
    import java.util.Arrays;
    public class Solution {
        public int findDuplicate(int[] nums) {
            
            Arrays.sort(nums);
            
            for(int i=0;i<nums.length;i++)
            {
                if(nums[i]==nums[i+1])
                return nums[i];
            }
            return 0;
        }
    }

  • 0
    E

    Pay attention to note 1: You must not modify the array (assume the array is read only).


Log in to reply
 

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