题目网址:https://leetcode.cn/leetbook/read/top-interview-questions-easy/x248f5/
public class Solution {
public bool ContainsDuplicate(int[] nums) {
for(int i=0;i<nums.Length;i++){
for(int j=i+1;j<nums.Length;j++){
if(nums[i]==nums[j]){
return true;
}
}
}
return false;
}
}
![](https://i-blog.csdnimg.cn/blog_migrate/276aebc2321dfe8b51fe16808a4585b5.png)