单调递增的数字 class Solution:def monotoneIncreasingDigits(self, n: int) -> int:nl [int(char) for char in str(n)]for i in range(len(nl)-1, 0, -1):if nl[i-1] > nl[i]:nl[i-1] - 1nl[i] 9for j in range(i, len(nl)):nl[j] 9return int("".join(s…
目录 A. Diverse Team
B. Substrings Sort
C. Equal Sums
D. Points and Powers of Two
E. Divisibility by 25
F. Rain and Umbrellas A. Diverse Team 找出不重复的同时存下下标即可,依次遍历map判断重复最后判断数量即可
void solve(){cin>>n>>…