- 博客(11)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 leetcode732+calender|||+hash map判断end点最多的值
https://leetcode.com/problems/my-calendar-iii/description/class MyCalendarThree {public: map<int, int> m; int maximum = 0; MyCalendarThree() { } int book(in...
2018-11-17 15:32:46
206
原创 leetcode713+子数组小于K是多少个，滑动窗口，双指针
https://leetcode.com/problems/subarray-product-less-than-k/description/class Solution {public: int numSubarrayProductLessThanK(vector<int>& nums, int k) { if (k <= 1...
2018-11-16 21:27:51
447
原创 leetcode744+找出最小的比当前大的字母，二分
https://leetcode.com/problems/find-smallest-letter-greater-than-target/description/class Solution {public: char nextGreatestLetter(vector<char>& letters, char target) { auto ...
2018-11-15 14:39:08
159
原创 leetcode752+从一串数字号码到另一串数字号码变化最少步数，BFS
https://leetcode.com/problems/open-the-lock/description/class Solution {public: int openLock(vector<string>& deadends, string target) { set<string>deadlock(deadends.beg...
2018-11-12 18:55:46
254
原创 leetcode739+判断每一位数字后面比他第一个大的数字相差位置，stack
https://leetcode.com/problems/daily-temperatures/description/class Solution {public: vector<int> dailyTemperatures(vector<int>& T) { int Tsize = T.size(); stack...
2018-11-09 11:50:04
707
原创 leetcode738+构造不大于n的单调递增数字，贪心
https://leetcode.com/problems/monotone-increasing-digits/description/class Solution {public: int monotoneIncreasingDigits(int N) { string str = to_string(N); int n = str.size()...
2018-11-08 12:02:24
249
原创 leetcode717+判断bit数组最后一位是否为0，贪心
https://leetcode.com/problems/1-bit-and-2-bit-characters/description/class Solution {public: bool isOneBitCharacter(vector<int>& bits) { int n = bits.size(), i = 0; w...
2018-11-07 11:04:21
330
原创 leetcode712+减少最少的字母凑成相同序列，最长公共子序列变形，DP
https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/class Solution {public: int minimumDeleteSum(string s1, string s2) { string res = ""; int dp[...
2018-11-07 10:39:32
129
原创 leetcode718+就是最长公共字串，Dp
https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/class Solution {public: int findLength(vector<int>& A, vector<int>& B) { int m = A.siz...
2018-11-06 17:13:30
209
原创 leetcode714+买卖股票带交易费，两个变量DP
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/class Solution {public: int maxProfit(vector<int>& prices, int fee) { int cash ...
2018-11-05 11:59:48
728
原创 leetcode668+乘法表第K小的数字，使用最大堆或者二分
https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/description/class Solution {public: int findKthNumber(int m, int n, int k) { if(m<n) swap(m, n); in...
2018-11-04 13:16:54
773
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人