Update Construct the Lexicographically Largest Valid Sequence

Author: AAAA-source

Daily Question/2025/February/Construct the Lexicographically Largest Valid Sequence

@@ -6,6 +6,8 @@ Time Complexity : O(n!) for there are n! possible sequence
 n * (n - 1) * (n - 2) ... * 1 = O(n!) )
 Space Complexity : O(n! for the recursion (recursion depth = O(n))
 
+實務上運算找到解的速度會比複雜度快上許多，因為設定上只要一找到解就可以回傳（同時題目保證一定有解）
+
 class Solution {
 public:
     vector<int> ans , appear ;