LeetCode 217 -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.

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

总结：之前做数组这种比较的题目做多了，很自然的想到，将数组进行排序，之后在逐个进行比较，运用flag来判断，效率还是很高的。