Class Solution

java.lang.Object
g1101_1200.s1122_relative_sort_array.Solution

public class Solution extends Object
1122 - Relative Sort Array.<p>Easy</p> <p>Given two arrays <code>arr1</code> and <code>arr2</code>, the elements of <code>arr2</code> are distinct, and all elements in <code>arr2</code> are also in <code>arr1</code>.</p> <p>Sort the elements of <code>arr1</code> such that the relative ordering of items in <code>arr1</code> are the same as in <code>arr2</code>. Elements that do not appear in <code>arr2</code> should be placed at the end of <code>arr1</code> in <strong>ascending</strong> order.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]</p> <p><strong>Output:</strong> [2,2,2,1,4,3,3,9,6,7,19]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]</p> <p><strong>Output:</strong> [22,28,8,6,17,44]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= arr1.length, arr2.length <= 1000</code></li> <li><code>0 <= arr1[i], arr2[i] <= 1000</code></li> <li>All the elements of <code>arr2</code> are <strong>distinct</strong>.</li> <li>Each <code>arr2[i]</code> is in <code>arr1</code>.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • relativeSortArray

      public int[] relativeSortArray(int[] arr1, int[] arr2)