목록3Sum (1)

초보 개발자의 기록

[Two Pointers] 3Sum

3Sum ProblemStatementGiven an integer array nums, find and return all unique triplets [nums[i], nums[j], nums[k]], where the indexes satisfy i≠j, i≠k, and j≠k, and the sum of the elements nums[i] + nums[j] + nums[k] == 0.Constraints3≤ nums.length ≤500−10^3≤ nums[i] ≤10^3Approaches* All numbers in the array are positive, so it is impossible to find any combination of three numbers that addes up t..
Coding Test 2025. 2. 1. 05:26
이전 Prev 1 Next 다음