毛无语666

摘要： 待续 阅读全文

摘要： C++语言 class Solution { public: int climbStairs(int n) { if (n <= 1) return 1; vector<int> dp(n); dp[0] = 1; dp[1] = 2; for (int i = 2; i < n; ++i) { d 阅读全文

摘要： Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文

摘要： 题目描述： Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t 阅读全文