xiaoyongyong

摘要： 62. Unique Paths Medium There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries t 阅读全文

摘要： 1726. Tuple with Same Product Medium 47322Add to ListShare Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) 阅读全文

摘要： 2370. Longest Ideal Subsequence Medium You are given a string s consisting of lowercase letters and an integer k. We call a string t ideal if the foll 阅读全文

摘要： 516. Longest Palindromic Subsequence Medium Given a string s, find the longest palindromic subsequence's length in s. A subsequence is a sequence that 阅读全文

摘要： 907. Sum of Subarray Minimums Medium Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. S 阅读全文

摘要： 300. Longest Increasing Subsequence Medium Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequenc 阅读全文

摘要： 01背包 假设有4个背包(weight,contribute)，(2,1),(3,3),(4,5),(7,9) 总重量:totalWeight = 10, 在不超过totalWeight的情况下如何使得contribute最大？每个背包最多只能使用一次 下面 i 表示前 i 个背包可选，j 表示to 阅读全文

摘要： 886. Possible Bipartition Medium We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some 阅读全文

摘要： 2262. Total Appeal of A String Hard The appeal of a string is the number of distinct characters found in the string. For example, the appeal of "abbca 阅读全文

摘要： 785. Is Graph Bipartite? Medium 4979279Add to ListShare There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. Yo 阅读全文