使用另一个数组最大化元素的 Python3 程序

给定两个大小为 n 的数组，通过使用第二个数组中的元素来最大化第一个数组，使得形成的新数组包含两个数组的 n 个最大但唯一的元素，从而赋予第二个数组优先级（第二个数组的所有元素出现在第一个数组之前）。元素的出现顺序在输出中与输入中保持相同。
例子：

Input : arr1[] = {2, 4, 3}
arr2[] = {5, 6, 1}
Output : 5 6 4
As 5, 6 and 4 are maximum elements from two arrays giving second array higher priority. Order of elements is same in output as in input.
Input : arr1[] = {7, 4, 8, 0, 1}
arr2[] = {9, 7, 2, 3, 6}
Output : 9 7 6 4 8

编程需要懂一点英语

方法：我们创建一个大小为 2*n 的辅助数组，并将第 2 个数组的元素存储在辅助数组中，然后我们将第 1 个数组的元素存储在其中。之后，我们将按降序对辅助数组进行排序。为了根据输入数组保持元素的顺序，我们将使用哈希表。我们将在哈希表中存储辅助数组的第 1 n 个最大唯一元素。现在我们遍历第二个数组并将第二个数组的元素存储在哈希表中存在的辅助数组中。同样，我们将遍历第一个数组并存储哈希表中存在的元素。通过这种方式，我们从辅助数组中的两个数组中获得 n 个唯一且最大的元素，同时保持元素的出现顺序相同。
以下是上述方法的实现：

Python3

# Python3 program to print the maximum elements
# giving second array higher priority
 
# Function to maximize array elements
def maximizeArray(arr1, arr2, n):
     
    # Auxiliary array arr3 to store
    # elements of arr1 & arr2
    arr3 = [0] * (2 * n)
    k = 0
     
    for i in range(n):
        arr3[k] = arr1[i]
        k += 1
         
    for i in range(n):
        arr3[k] = arr2[i]
        k += 1
 
    # Hash table to store n largest
    # unique elements
    hash = {}
 
    # Sorting arr3 in decreasing order
    arr3 = sorted(arr3)
    arr3 = arr3[::-1]
 
    # Finding n largest unique elements
    # from arr3 and storing in hash
    i = 0
    while (len(hash) != n):
 
        # If arr3 element not present in hash,
        # then store this element in hash
        if (arr3[i] not in hash):
            hash[arr3[i]] = 1
 
        i += 1
 
    # Store that elements of arr2 in arr3
    # that are present in hash
    k = 0
    for i in range(n):
 
        # If arr2 element is present in
        # hash, store it in arr3
        if (arr2[i] in hash):
            arr3[k] = arr2[i]
            k += 1
             
            del hash[arr2[i]]
 
    # Store that elements of arr1 in arr3
    # that are present in hash
    for i in range(n):
 
        # If arr1 element is present
        # in hash, store it in arr3
        if (arr1[i] in hash):
            arr3[k] = arr1[i]
            k += 1
             
            del hash[arr1[i]]
 
    # Copying 1st n elements of
    # arr3 to arr1
    for i in range(n):
        arr1[i] = arr3[i]
 
# Function to print array elements
def printArray(arr, n):
     
    for i in arr:
        print(i, end = " ")
         
    print()
 
# Driver Code
if __name__ == '__main__':
     
    array1 = [ 7, 4, 8, 0, 1 ]
    array2 = [ 9, 7, 2, 3, 6 ]
    size = len(array1)
     
    maximizeArray(array1, array2, size)
    printArray(array1, size)
     
# This code is contributed by mohit kumar 29

输出：

9 7 6 4 8

时间复杂度：O(n * log n)。

有关更多详细信息，请参阅有关使用另一个数组最大化元素的完整文章！