摘要：
Description Description Given two strings S and T. Count the number of distinct subsequences of S which equals T. A subsequence of a string is a new s 阅读全文
posted @ 2019-12-21 22:09
YuriFLAG
阅读(254)
评论(0)
推荐(0)
摘要：
Description Given n kinds of items, and each kind of item has an infinite number available. The i-th item has size A[i] and value V[i]. Also given a b 阅读全文
posted @ 2019-12-21 22:06
YuriFLAG
阅读(202)
评论(0)
推荐(0)
摘要：
Description Description Given an integer array nums[] which contains n unique positive numbers, num[i] indicate the size of ith item. An integer targe 阅读全文
posted @ 2019-12-21 22:04
YuriFLAG
阅读(280)
评论(0)
推荐(0)
摘要：
Description Description Given n items with size nums[i] which an integer array and all positive numbers. An integer target denotes the size of a backp 阅读全文
posted @ 2019-12-21 22:02
YuriFLAG
阅读(209)
评论(0)
推荐(0)
摘要：
Description Given an integer array nums with all positive numbers and no duplicates, find the number of possible combinations that add up to a positiv 阅读全文
posted @ 2019-12-21 21:56
YuriFLAG
阅读(203)
评论(0)
推荐(0)
摘要：
Description Description Given n distinct positive integers, integer k (k <= n) and a number target. Find k numbers where sum is target. Calculate how 阅读全文
posted @ 2019-12-21 21:54
YuriFLAG
阅读(311)
评论(0)
推荐(0)
摘要：
Description Description Given a set of strings which just has lower case letters and a target string, output all the strings for each the edit distanc 阅读全文
posted @ 2019-12-21 21:50
YuriFLAG
阅读(225)
评论(0)
推荐(0)
摘要：
Description Description Given two strings, find the longest common subsequence (LCS). Your code should return the length of LCS. Clarification What's 阅读全文
posted @ 2019-12-21 21:47
YuriFLAG
阅读(301)
评论(0)
推荐(0)
摘要：
Description Given n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this backpack? Description Description Give 阅读全文
posted @ 2019-12-21 21:46
YuriFLAG
阅读(244)
评论(0)
推荐(0)
摘要：
Description Description Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is count 阅读全文
posted @ 2019-12-21 21:44
YuriFLAG
阅读(212)
评论(0)
推荐(0)
浙公网安备 33010602011771号