Package g3601_3700.s3668_restore_finishing_order

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3668 - Restore Finishing Order.

    Easy

    You are given an integer array order of length n and an integer array friends.

    • order contains every integer from 1 to n exactly once , representing the IDs of the participants of a race in their finishing order.

    • friends contains the IDs of your friends in the race sorted in strictly increasing order. Each ID in friends is guaranteed to appear in the order array.

    Return an array containing your friends' IDs in their finishing order.

    Example 1:

    Input: order = 3,1,2,5,4, friends = 1,3,4

    Output: 3,1,4

    Explanation:

    The finishing order is <code><ins> **3** </ins>, <ins> **1** </ins>, 2, 5, <ins> **4** </ins></code>. Therefore, the finishing order of your friends is [3, 1, 4].

    Example 2:

    Input: order = 1,4,5,3,2, friends = 2,5

    Output: 5,2

    Explanation:

    The finishing order is <code>1, 4, <ins> **5** </ins>, 3, <ins> **2** </ins></code>. Therefore, the finishing order of your friends is [5, 2].

    Constraints:

    • 1 &lt;= n == order.length &lt;= 100

    • order contains every integer from 1 to n exactly once

    • 1 &lt;= friends.length &lt;= min(8, n)

    • 1 &lt;= friends[i] &lt;= n

    • friends is strictly increasing

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray recoverOrder(IntArray order, IntArray friends)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait