Fix Merge Intervals

function merge(intervals) {
  intervals.sort((a, b) => a[0] - b[0]);
  const out = [];
  for (const cur of intervals) {
    const last = out[out.length - 1];
    if (last && cur[0] <= last[1]) last[1] = Math.max(last[1], cur[1]);
    else out.push([...cur]);
  }
  return out;
}

function merge(intervals: number[][]): number[][] {
  intervals.sort((a, b) => a[0] - b[0]);
  const out: number[][] = [];
  for (const cur of intervals) {
    const last = out[out.length - 1];
    if (last && cur[0] <= last[1]) last[1] = Math.max(last[1], cur[1]);
    else out.push([...cur]);
  }
  return out;
}

def merge(intervals: list[list[int]]) -> list[list[int]]:
    out: list[list[int]] = []
    for cur in sorted(intervals):
        if out and cur[0] <= out[-1][1]:
            out[-1][1] = max(out[-1][1], cur[1])
        else:
            out.append(list(cur))
    return out

<?php

function merge(array $intervals): array
{
    usort($intervals, fn ($a, $b) => $a[0] <=> $b[0]);
    $out = [];
    foreach ($intervals as $cur) {
        $k = count($out) - 1;
        if ($k >= 0 && $cur[0] <= $out[$k][1]) {
            $out[$k][1] = max($out[$k][1], $cur[1]);
        } else {
            $out[] = $cur;
        }
    }
    return $out;
}

class Solution {
    public int[][] merge(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> Integer.compare(a[0], b[0]));
        List<int[]> out = new ArrayList<>();
        for (int[] cur : intervals) {
            if (!out.isEmpty() && cur[0] <= out.get(out.size() - 1)[1]) {
                int[] last = out.get(out.size() - 1);
                last[1] = Math.max(last[1], cur[1]);
            } else {
                out.add(new int[]{cur[0], cur[1]});
            }
        }
        return out.toArray(new int[0][]);
    }
}