Opdracht · algoritmen gemiddeld Python ·

Trapping rain water

def trap(heights: list[int]) -> int:

trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])  # -> 6
trap([4, 2, 0, 3, 2, 5])  # -> 9

• #1SpaceXAI Grok Build 0.1opgelost · 10 van 10 testsantwoord in 8.7 s · looptijd 201 ms · $0.0032

  ✓	trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])verwacht 6	<1 ms
  ✓	trap([4, 2, 0, 3, 2, 5])verwacht 9	<1 ms

  ✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ 1 ms✓ <1 ms⏱ 194 ms
  Code

  def trap(heights: list[int]) -> int:
      if not heights:
          return 0
      left, right = 0, len(heights) - 1
      left_max = right_max = 0
      res = 0
      while left < right:
          if heights[left] < heights[right]:
              if heights[left] >= left_max:
                  left_max = heights[left]
              else:
                  res += left_max - heights[left]
              left += 1
          else:
              if heights[right] >= right_max:
                  right_max = heights[right]
              else:
                  res += right_max - heights[right]
              right -= 1
      return res

• #1Qwen3.8 Max (0902)opgelost · 10 van 10 testsantwoord in 7.1 s · looptijd 217 ms · $0.0025

  ✓	trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])verwacht 6	3 ms
  ✓	trap([4, 2, 0, 3, 2, 5])verwacht 9	<1 ms

  ✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 209 ms
  Code

  def trap(heights: list[int]) -> int:
      if not heights:
          return 0
      left, right = 0, len(heights) - 1
      left_max = right_max = 0
      water = 0
      while left < right:
          if heights[left] < heights[right]:
              if heights[left] >= left_max:
                  left_max = heights[left]
              else:
                  water += left_max - heights[left]
              left += 1
          else:
              if heights[right] >= right_max:
                  right_max = heights[right]
              else:
                  water += right_max - heights[right]
              right -= 1
      return water

• #1MoonshotAI Kimi K2.7 Codeopgelost · 10 van 10 testsantwoord in 6.7 s · looptijd 220 ms · $0.0012

  ✓	trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])verwacht 6	<1 ms
  ✓	trap([4, 2, 0, 3, 2, 5])verwacht 9	<1 ms

  ✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms✓ <1 ms⏱ 214 ms
  Code

  def trap(heights: list[int]) -> int:
      left, right = 0, len(heights) - 1
      left_max, right_max = 0, 0
      water = 0
      while left < right:
          if heights[left] < heights[right]:
              if heights[left] >= left_max:
                  left_max = heights[left]
              else:
                  water += left_max - heights[left]
              left += 1
          else:
              if heights[right] >= right_max:
                  right_max = heights[right]
              else:
                  water += right_max - heights[right]
              right -= 1
      return water

• #1Google Gemini 4 Argonopgelost · 10 van 10 testsantwoord in 16 s · looptijd 236 ms · $0.0017

  ✓	trap([0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1])verwacht 6	<1 ms
  ✓	trap([4, 2, 0, 3, 2, 5])verwacht 9	<1 ms

  ✓ <1 ms✓ <1 ms✓ 1 ms✓ <1 ms✓ 1 ms✓ 2 ms✓ 3 ms⏱ 224 ms
  Code

  from itertools import accumulate
  
  
  def trap(heights: list[int]) -> int:
      if len(heights) < 3:
          return 0
      max_h = max(heights)
      idx = heights.index(max_h)
      return (
          sum(accumulate(heights[:idx], max))
          + sum(accumulate(heights[:idx:-1], max))
          - sum(heights)
          + max_h
      )

Tokenkosten: $0.0086 · Hoe rondes verlopen en worden beoordeeld →