xiaoyongyong

摘要： 3738. Longest Non-Decreasing Subarray After Replacing at Most One Element You are given an integer array nums. You are allowed to replace at most one 阅读全文

摘要： 3821. Find Nth Smallest Integer With K One Bits You are given two positive integers n and k. Return an integer denoting the nth smallest positive inte 阅读全文

摘要： 3800. Minimum Cost to Make Two Binary Strings Equal You are given two binary strings s and t, both of length n, and three positive integers flipCost,  阅读全文

摘要： 2376. Count Special Integers We call a positive integer special if all of its digits are distinct. Given a positive integer n, return the number of sp 阅读全文

摘要： 122. Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each da 阅读全文

摘要： 对于一个数组 arr[1...n]，Fenwick Tree 可以支持两种操作： update(i, delta)：将 arr[i] += delta query(i)：返回前缀和 arr[1] + arr[2] + ... + arr[i] 它的时间复杂度为： 构建：O(n) 查询：O(log n 阅读全文

摘要： 3447. Assign Elements to Groups with Constraints Solved Medium Topics Companies Hint You are given an integer array groups, where groups[i] represents 阅读全文

摘要： 1878. Get Biggest Three Rhombus Sums in a Grid You are given an m x n integer matrix grid​​​. A rhombus sum is the sum of the elements that form the b 阅读全文

摘要： 126. Word Ladder II A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 - 阅读全文

摘要： 使用着色法来判定一个图是否为二分图，或者是否包含奇环（包含奇环的话就不是二分图） 785. Is Graph Bipartite? There is an undirected graph with n nodes, where each node is numbered between 0 and 阅读全文