克隆和减去集合 - 这是否有效？

# 克隆集合
original_set = {1, 2, 3, 4, 5}
cloned_set = original_set.copy()

# 减去集合
original_set = {1, 2, 3, 4, 5}
set_to_remove = {3, 4}
result_set = original_set - set_to_remove

// 克隆集合
const originalSet = new Set([1, 2, 3, 4, 5]);
const clonedSet = new Set(originalSet);

// 减去集合
const originalSet = new Set([1, 2, 3, 4, 5]);
const setToRemove = new Set([3, 4]);
const resultSet = new Set([...originalSet].filter(x => !setToRemove.has(x)));

import java.util.HashSet;
import java.util.Set;

public class Main {
    public static void main(String[] args) {
        // 克隆集合
        Set<Integer> originalSet = new HashSet<>();
        originalSet.add(1);
        originalSet.add(2);
        originalSet.add(3);
        originalSet.add(4);
        originalSet.add(5);

        Set<Integer> clonedSet = new HashSet<>(originalSet);

        // 减去集合
        Set<Integer> setToRemove = new HashSet<>();
        setToRemove.add(3);
        setToRemove.add(4);

        Set<Integer> resultSet = new HashSet<>(originalSet);
        resultSet.removeAll(setToRemove);
    }
}