模拟,有重复只能去重了,没想到其他巧妙的方法
class Solution {
public:
int minOperations(vector<int>& nums, int k) {
int t = k, res = 0;
bool st[51] = {0};
for (int i = nums.size() - 1; i >= 0; i -- ) {
if (nums[i] <= t && !st[nums[i]]) k -- , st[nums[i]] = true;
res ++ ;
if (!k) break;
}
return res;
}
};