수쿵의 IT월드

문제Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1:Input: nums = [100,4,200,1,3,2]Output: 4Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. Example 2:Input: nums = [0,3,7,2,5,8,4,6,0,1]Output: 9 Example 3:Input: nums = [1,0,1,2]O..

문제Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order. Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]. Examp..

문제Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1:input: nums = [1,2,3,1]Output: trueExplanation: The element 1 occurs at the indices 0 and 3. Example 2:input: nums = [1,2,3,4]Output: falseExplanation: All elements are distinct. Example 3:input: nums = [1,1,1,3,3,4,3,2,4,2]Output: trueConstraints:..