363738394041424344454647484950515253545556575859606162636465666768697071727374

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution
{
    public List<int> unionArray(List<int> nums1, List<int> nums2)
    {
        // Array to store the union elements
        List<int> union = new List<int>();
        int i = 0, j = 0;
        int n = nums1.Count;
        int m = nums2.Count;

        while (i < n && j < m)
        {
            // Case 1 and 2
            if (nums1[i] <= nums2[j])
            {
                if (union.Count == 0 || union[union.Count - 1] != nums1[i])
                {
                    union.Add(nums1[i]);
                }
                i++;
            }
            // Case 3
            else
            {
                if (union.Count == 0 || union[union.Count - 1] != nums2[j])
                {
                    union.Add(nums2[j]);
                }
                j++;
            }
        }

        // Add remaining elements of nums1, if any
        while (i < n)
        {
            if (union.Count == 0 || union[union.Count - 1] != nums1[i])
            {
                union.Add(nums1[i]);
            }
            i++;
        }

        // Add remaining elements of nums2, if any
        while (j < m)
        {
            if (union.Count == 0 || union[union.Count - 1] != nums2[j])
            {
                union.Add(nums2[j]);
            }
            j++;
        }

        return union;
    }

    public static void Main(string[] args)
    {
        List<int> nums1 = new List<int> { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
        List<int> nums2 = new List<int> { 2, 3, 4, 4, 5, 11, 12 };

        // Create an instance of the Solution class
        Solution finder = new Solution();

        // Get union of nums1 and nums2 using class method
        List<int> union = finder.unionArray(nums1, nums2);

        Console.WriteLine("Union of nums1 and nums2 is:");
        Console.WriteLine($"[{string.Join(", ", union)}]");
    }
}

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859

package main

import (
    "fmt"
)

// unionArray merges two sorted slices into a sorted union without changing structure
func unionArray(nums1 []int, nums2 []int) []int {
    Union := make([]int, 0) // Slice to store the union elements
    i, j := 0, 0
    n, m := len(nums1), len(nums2)

    for i < n && j < m {
        // Case 1 and 2