classSolution{publicbooleancontainsDuplicate(int[] nums){HashSet<Integer> set =newHashSet<>();for(int i =0; i < nums.length; i++){
set.add(nums[i]);}if(nums.length == set.size()){returnfalse;}returntrue;}}
classSolution{publicintsingleNumber(int[] nums){HashSet<Integer> set =newHashSet<>();ArrayList<Integer> list =newArrayList<>();
list.removeAll(Collections.singleton(0));for(int i =0; i < nums.length ; i++){
list.add(nums[i]);boolean add = set.add(nums[i]);if(!add){
list.removeAll(Collections.singleton(nums[i]));}}return list.get(0);}}
Java返回两个数组的交集
给定两个数组,编写一个函数来计算它们的交集。
classSolution{publicint[]intersection(int[] nums1,int[] nums2){HashSet<Integer> setA =newHashSet<>();HashSet<Integer> setB =newHashSet<>();ArrayList<Integer> integers =newArrayList<>();for(int i =0; i < nums1.length; i++){
setA.add(nums1[i]);}for(int i =0; i < nums2.length; i++){
setB.add(nums2[i]);}for(Integer i : setB){if(setA.contains(i)){
integers.add(i);}}int[] ints =newint[integers.size()];for(int i =0; i < integers.size(); i++){
ints[i]= integers.get(i);}return ints;}}
Java返回存在重复元素给定一个整数数组,判断是否存在重复元素。如果存在一值在数组中出现至少两次,函数返回 true 。如果数组中每个元素都不相同,则返回 false 。class Solution { public boolean containsDuplicate(int[] nums) { HashSet<Integer> set = new HashSet<>(); for (int i = 0; i < nums.le