Tugas · algoritma sulit JavaScript ·

Largest rectangle in a histogram

/**
 * @param {number[]} heights
 * @returns {number}
 */
function largest_rectangle(heights)

largest_rectangle([2, 1, 5, 6, 2, 3])  // -> 10
largest_rectangle([2, 4])  // -> 4

• #1Google Gemini 4 Argonselesai · 10 dari 10 pengujianrespons dalam 6.8 dtk · waktu eksekusi 121 md · $0.0032

  ✓	largest_rectangle([2, 1, 5, 6, 2, 3])diharapkan 10	7 md
  ✓	largest_rectangle([2, 4])diharapkan 4	2 md

  ✓ <1 md✓ <1 md✓ 3 md✓ 3 md✓ 1 md✓ <1 md⏱ 51 md⏱ 52 md
  Kode

  /**
   * @param {number[]} heights
   * @returns {number}
   */
  function largest_rectangle(heights) {
      const n = heights.length;
      if (n === 0) return 0;
  
      // Using Int32Array for the stack avoids dynamic array allocations and is very fast
      const stack = new Int32Array(n + 1);
      let top = -1;
      let maxArea = 0;
  
      for (let i = 0; i <= n; i++) {
          const h = i === n ? 0 : heights[i];
          while (top >= 0 && heights[stack[top]] >= h) {
              const height = heights[stack[top--]];
              const width = top === -1 ? i : i - stack[top] - 1;
              const area = height * width;
              if (area > maxArea) {
                  maxArea = area;
              }
          }
          stack[++top] = i;
      }
  
      return maxArea;
  }

• #1DeepSeek V4.1 Flashselesai · 10 dari 10 pengujianrespons dalam 2.4 dtk · waktu eksekusi 128 md · $0.0001

  ✓	largest_rectangle([2, 1, 5, 6, 2, 3])diharapkan 10	2 md
  ✓	largest_rectangle([2, 4])diharapkan 4	2 md

  ✓ 1 md✓ 1 md✓ <1 md✓ 22 md✓ 3 md✓ 4 md⏱ 26 md⏱ 67 md
  Kode

  function largest_rectangle(heights) {
    const n = heights.length;
    if (n === 0) return 0;
    const stack = new Int32Array(n + 1);
    let top = -1;
    let best = 0;
    for (let i = 0; i <= n; i++) {
      const h = i < n ? heights[i] : 0;
      while (top >= 0 && heights[stack[top]] >= h) {
        const height = heights[stack[top--]];
        const left = top >= 0 ? stack[top] : -1;
        const area = height * (i - left - 1);
        if (area > best) best = area;
      }
      stack[++top] = i;
    }
    return best;
  }

• #3SpaceXAI Grok 4.7selesai · 10 dari 10 pengujianrespons dalam 16 dtk · waktu eksekusi 190 md · $0.0099

  ✓	largest_rectangle([2, 1, 5, 6, 2, 3])diharapkan 10	2 md
  ✓	largest_rectangle([2, 4])diharapkan 4	3 md

  ✓ <1 md✓ 1 md✓ 18 md✓ 1 md✓ 2 md✓ 1 md⏱ 44 md⏱ 118 md
  Kode

  function largest_rectangle(heights) {
      const n = heights.length;
      const stack = [];
      let maxArea = 0;
      for (let i = 0; i <= n; i++) {
          const h = i === n ? 0 : heights[i];
          while (stack.length > 0 && heights[stack[stack.length - 1]] > h) {
              const height = heights[stack.pop()];
              const width = stack.length === 0 ? i : i - stack[stack.length - 1] - 1;
              const area = height * width;
              if (area > maxArea) maxArea = area;
          }
          stack.push(i);
      }
      return maxArea;
  }

• #3Mistral Devstral 2 2512selesai · 10 dari 10 pengujianrespons dalam 1.4 dtk · waktu eksekusi 200 md · $0.0004

  ✓	largest_rectangle([2, 1, 5, 6, 2, 3])diharapkan 10	3 md
  ✓	largest_rectangle([2, 4])diharapkan 4	1 md

  ✓ 3 md✓ 5 md✓ 1 md✓ 1 md✓ <1 md✓ 1 md⏱ 68 md⏱ 117 md
  Kode

  function largest_rectangle(heights) {
      const stack = [];
      let maxArea = 0;
      const n = heights.length;
  
      for (let i = 0; i <= n; i++) {
          const h = i === n ? 0 : heights[i];
          while (stack.length > 0 && h < heights[stack[stack.length - 1]]) {
              const height = heights[stack.pop()];
              const width = stack.length === 0 ? i : i - stack[stack.length - 1] - 1;
              maxArea = Math.max(maxArea, height * width);
          }
          stack.push(i);
      }
  
      return maxArea;
  }

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