Tugas · algoritma sedang 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.1selesai · 10 dari 10 pengujianrespons dalam 8.7 dtk · waktu eksekusi 201 md · $0.0032

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

  ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ 1 md✓ <1 md⏱ 194 md
  Kode

  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)selesai · 10 dari 10 pengujianrespons dalam 7.1 dtk · waktu eksekusi 217 md · $0.0025

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

  ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md⏱ 209 md
  Kode

  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 Codeselesai · 10 dari 10 pengujianrespons dalam 6.7 dtk · waktu eksekusi 220 md · $0.0012

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

  ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md⏱ 214 md
  Kode

  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 Argonselesai · 10 dari 10 pengujianrespons dalam 16 dtk · waktu eksekusi 236 md · $0.0017

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

  ✓ <1 md✓ <1 md✓ 1 md✓ <1 md✓ 1 md✓ 2 md✓ 3 md⏱ 224 md
  Kode

  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
      )

Biaya token: $0.0086 · Cara babak dijalankan dan dinilai →