LC-2848 Easy LeetCode

2848. Points That Intersect With Cars

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 73% Topics: Array, Hash Table, Prefix Sum

Reading material

Arrays & Hashing 12 min Prefix Sums & Difference Arrays 11 min

Reference solution (spoiler · python)

# Time:  O(nlogn)
# Space: O(1)

# sort, line sweep
class Solution(object):
    def numberOfPoints(self, nums):
        """
        :type nums: List[List[int]]
        :rtype: int
        """
        nums.sort()
        result = 0
        curr = nums[0]
        for i in xrange(1, len(nums)):
            if nums[i][0] <= curr[1]:
                curr[1] = max(curr[1], nums[i][1])
            else:
                result += curr[1]-curr[0]+1
                curr = nums[i]
        result += curr[1]-curr[0]+1
        return result

Solution from kamyu104/LeetCode-Solutions · MIT