Library Shelf Merge Log

import java.util.*;
class Solution {
    public Object library_shelf_merge_log(Object input) {
        Object[] args = (Object[]) input;
        int[][] shelves_arr = (int[][]) args[0];
        int[][] merges = (int[][]) args[1];
        List<List<Integer>> s = new ArrayList<>();
        for (int[] sh : shelves_arr) {
            List<Integer> list = new ArrayList<>();
            for (int x : sh) list.add(x);
            s.add(list);
        }
        Set<Integer> to_remove = new HashSet<>();
        for (int k = merges.length - 1; k >= 0; k--) {
            int i = merges[k][0], j = merges[k][1];
            s.get(i).addAll(s.get(j));
            Collections.sort(s.get(i));
            to_remove.add(j);
        }
        List<int[]> resList = new ArrayList<>();
        for (int idx = 0; idx < s.size(); idx++) {
            if (!to_remove.contains(idx)) {
                List<Integer> list = s.get(idx);
                int[] row = new int[list.size()];
                for (int m_idx = 0; m_idx < list.size(); m_idx++) row[m_idx] = list.get(m_idx);
                resList.add(row);
            }
        }
        return resList.toArray(new int[0][]);
    }
}

function library_shelf_merge_log(shelves, merges) {
    let s = shelves.map(x => [...x]);
    let to_remove = new Set();
    for (let k = merges.length - 1; k >= 0; k--) {
        const [i, j] = merges[k];
        s[i].push(...s[j]);
        s[i].sort((a, b) => a - b);
        to_remove.add(j);
    }
    return s.filter((_, idx) => !to_remove.has(idx));
}

<?php
function library_shelf_merge_log($shelves, $merges) {
    $s = $shelves;
    $to_remove = [];
    for ($k = count($merges) - 1; $k >= 0; $k--) {
        $i = $merges[$k][0]; $j = $merges[$k][1];
        $s[$i] = array_merge($s[$i], $s[$j]);
        sort($s[$i]);
        $to_remove[$j] = true;
    }
    $res = [];
    foreach ($s as $idx => $val) {
        if (!isset($to_remove[$idx])) $res[] = $val;
    }
    return $res;
}
?>

def library_shelf_merge_log(shelves, merges):
    shelves = [list(s) for s in shelves]
    to_remove = set()
    for i, j in reversed(merges):
        shelves[i].extend(shelves[j])
        shelves[i].sort()
        to_remove.add(j)
    return [s for idx, s in enumerate(shelves) if idx not in to_remove]

pub fn library_shelf_merge_log(shelves: Vec<Vec<i32>>, merges: Vec<Vec<usize>>) -> Vec<Vec<i32>> {
    let mut s = shelves.clone();
    let mut to_remove = std::collections::HashSet::new();
    for m in merges.into_iter().rev() {
        let i = m[0]; let j = m[1];
        let mut temp = s[j].clone();
        s[i].append(&mut temp);
        s[i].sort();
        to_remove.insert(j);
    }
    s.into_iter().enumerate().filter(|(idx, _)| !to_remove.contains(idx)).map(|(_, v)| v).collect()
}

function library_shelf_merge_log(shelves: number[][], merges: number[][]): number[][] {
    let s = shelves.map(x => [...x]);
    let to_remove: {[key: number]: boolean} = {};
    for (let k = merges.length - 1; k >= 0; k--) {
        const [i, j] = merges[k];
        s[i].push(...s[j]);
        s[i].sort((a, b) => a - b);
        to_remove[j] = true;
    }
    return s.filter((_, idx) => !to_remove[idx]);
}