[code]class Solution {public boolean containsDuplicate(int[] nums) {if(nums == null || nums.length == 0){return false;}Set<Integer> seen = new HashSet<>();for(int num: nums){// If the set already has this element, add() method will return falseif(!seen.add(num)){return true;}}return false;}}
爱站程序员基地
![[翻译] Backpressure explained — the resisted flow of data through software-爱站程序员基地](https://aiznh.com/wp-content/uploads/2021/05/4-220x150.jpeg)

