3396. Minimum Number of Operations to Make Elements in Array Distinct ===================================================================== :题号: 3396 :题名: Minimum Number of Operations to Make Elements in Array Distinct :类型: Algorithms(元数据占位) :难度: Easy :原题: `LeetCode 3396 `_ :数据源: LeetCode GraphQL :处理状态: 题目文件已建立;题目信息、题目重述与自建示例待下一轮补充。