leetcode - 1359. Count All Valid Pickup and Delivery Options

Description

Given n orders, each order consists of a pickup and a delivery service.

Count all valid pickup/delivery possible sequences such that delivery(i) is always after of pickup(i).

Since the answer may be too large, return it modulo 10^9 + 7.

Example 1:

Input: n = 1
Output: 1
Explanation: Unique order (P1, D1), Delivery 1 always is after of Pickup 1.

Example 2:

Input: n = 2
Output: 6
Explanation: All possible orders: 
(P1,P2,D1,D2), (P1,P2,D2,D1), (P1,D1,P2,D2), (P2,P1,D1,D2), (P2,P1,D2,D1) and (P2,D2,P1,D1).
This is an invalid order (P1,D2,P2,D1) because Pickup 2 is after of Delivery 2.

Example 3:

Input: n = 3
Output: 90

Constraints:

1 <= n <= 500

Solution

Math

The total number of permutation of 2n numbers is: (2n)!, and if pick is at the front of delivery, there would be 2^n pairs. So we divide by it.

Recursive

If we have n-1 numbers, then to insert n delivery, there are 2*(n-1)+1=2n-1 choices, and to insert n pickup, there are 2*(n-1)+1+1=2n choices. Because pickup can’t be at the front of delivery, so we divide by 2.

Code

Math

class Solution:
    def countOrders(self, n: int) -> int:
        a_nn = 1
        mod_val = 1000000007
        for i in range(1, 2 * n + 1):
            a_nn *= i
        return (a_nn >> n) % mod_val

Recursive

class Solution:
    def countOrders(self, n: int) -> int:
        res = 1
        mod_val = 1000000007
        for i in range(1, n + 1):
            res *= (2 * i - 1) * i
            res %= mod_val
        return res