You are given an integer array nums.

An array is considered good if it is a permutation of an array base[n], defined as base[n] = [$1$, $2$, ..., $n - 1$, $n$, $n$] for some positive integer $n$.

In other words, base[n] has a length of $n + 1$ and contains each integer from $1$ to $n - 1$ exactly once, with the integer $n$ appearing exactly twice.

Return true if nums is a good array, or false otherwise.

Note: A permutation of an array is an arrangement of its elements in any order.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 200$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.