Given an integer array nums, return the greatest common divisor of the smallest number and largest number in nums. The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.   Example 1: Input: nums = [2,5…

返回 s 字典序最小的子序列，该子序列包含 s 的所有不同字符，且只包含一次。   示例 1： 输入：s = "bcabc" 输出："abc" 示例 2： 输入：s = "cbacdcbc" 输出："acdb"   提示：

Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.   Example 1: Input: s = "bcabc" Output: "abc" Example 2: Input: s = "cbacdcbc" Output: "acdb"   Constraints:

给你一个 m 行 n 列的二维网格 grid 和一个整数 k。你需要将 grid 迁移 k 次。 每次「迁移」操作将会引发下述活动：