摘要:
题目描述: 解法: class Solution {public: int lengthOfLongestSubstring(string s) { int n = s.size(); if(n dp(128, -1); ... 阅读全文
摘要:
题目描述: 解法: class Solution {public: int mincostTickets(vector& days, vector& costs) { int n=days.size(); vector dp... 阅读全文
摘要:
题目描述: 解法一(递归): class Solution {public: int coinChange(vector& coins, int amount) { if(amount==0) return 0; int r... 阅读全文
摘要:
496. 下一个更大元素 I 题目描述: 解法(单调栈+哈希表): class Solution {public: vector nextGreaterElement(vector& nums1, vector& nums2) { int... 阅读全文
摘要:
题目描述: 解法一(暴力): class Solution {public: vector dailyTemperatures(vector& T) { int n = T.size(); vector res(n, 0);... 阅读全文