LeetCode Contains Duplicate JAVA

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

这道题目比较简单了，就是判断数组中有没有重复的数字。那么我们直接先把它sort一下，这样的话直接循环判断相邻的数组有没有相等的值就可以了。代码如下：

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