1class Solution {2 public boolean containsDuplicate(int[] nums) {3 Arrays.sort(nums);4 int n = nums.length;5 for (int i = 1; i < n; i++) {6 if (nums[i] == nums[i - 1]) return true;7 }8 return false;9 }10}
WPM •0 •0
ACC •0 •0
TIME •0