two-pointer2 LeetCode 15. 3Sum [Medium] Problem: Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. Example: Summary: Using a two-pointer move left and the right pointer to compare the sum of three-element. Code: class Solution: def threeSum(self, nums: List[int]) ->.. 2020. 8. 25. LeetCode 42. Trapping Rain Water [Hard] Problem: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image! Example: Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: .. 2020. 8. 24. 이전 1 다음
