airforce

摘要： Problem:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADO... 阅读全文

摘要： Problem:Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from ... 阅读全文

摘要： Problem:Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted arraynums=[1,1,1,2,2,3],Your function s... 阅读全文

摘要： Problem:Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For exam... 阅读全文

摘要： Problem:Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note:Elements in a subset must be in non-descen... 阅读全文

摘要： Problem:Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following uni... 阅读全文

摘要： Problem:Find all possible combinations ofknumbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination shoul... 阅读全文

摘要： Problem:Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each... 阅读全文

摘要： Problem:Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.link:https://leetco... 阅读全文

摘要： Problem:The set[1,2,3,…,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order,We get the following sequ... 阅读全文