leetcode
lyy_g
这个作者很懒,什么都没留下…
展开
-
LeetCode:48. Rotate Image
代码如下:class Solution {public: void rotate(vector<vector<int>>& matrix) { vector<vector<int> > temp(matrix.size(), vector<int>(matrix.size())); temp原创 2017-09-24 19:49:48 · 157 阅读 · 0 评论 -
Leetcode: 621. Task Scheduler
题目大意: 给定一些任务以及一个整数时隙n,26种从A~Z。CPU每个时隙可以处理一个任务,处理一个任务后需要经过n时隙后才能处理一个相同的任务,但是这n个时隙可以利用起来处理别的任务。给出最少时隙。c++code:class Solution {public: int leastInterval(vector<char>& tasks, int n) { vec原创 2017-12-26 20:17:13 · 260 阅读 · 0 评论 -
Leetcode:741. Cherry Pickup
c++code:class Solution {public:int cherryPickup(vector<vector<int>>& grid) { int n = grid.size(); int maxK = 2 * n - 1; int dp[maxK][n][n] = {-1}; memset(dp, -1, sizeof(dp)); for(原创 2017-12-10 22:53:36 · 641 阅读 · 0 评论 -
Leetcode:714. Best Time to Buy and Sell Stock with Transaction Fee
c++:class Solution {public: int maxProfit(vector<int>& prices, int fee) { int len = prices.size(); vector<int> maxProfit(len), cashWhenHoldOne(len); maxProfit[0] = 0, cashW原创 2017-12-10 22:52:20 · 175 阅读 · 0 评论 -
Leetcode:523. Continuous Subarray Sum
c++code:class Solution { public: bool checkSubarraySum(vector<int>& nums, int k) { unordered_map<int, int> hash; int sum = 0; hash[0] = -1; for(int i=0; i原创 2017-12-10 22:50:24 · 226 阅读 · 0 评论 -
Leetcode:467. Unique Substrings in Wraparound String
c++code:class Solution {public: int findSubstringInWraproundString(string p) { vector<int> cnt(26, 0); int len = 0; for (int i = 0; i < p.size(); ++i) { if (i >原创 2017-12-10 22:49:11 · 143 阅读 · 0 评论 -
Leetcode: 664. Strange Printer
This problem is simiiar to #546(Leetcode) Remove Boxes which uses f[l][r][k] to store the maximum points of range [l, r] with k boxes equal to r. But for this problem, we can use 2D-array DP instead of原创 2017-11-14 20:56:43 · 267 阅读 · 0 评论 -
Leetcode: 300. Longest Increasing Subsequence
c++ code:class Solution {public: int lengthOfLIS(vector<int>& nums) { vector<int> dp(nums.size(), 1); int ans = 0; for (int i = 0; i < nums.size(); ++i) { for (原创 2017-11-05 20:22:53 · 152 阅读 · 0 评论 -
Leetcode: 650. 2 Keys Keyboard
c++:class Solution {public: int minSteps(int n) { if (n == 1) return 0; for (int i = 2; i < n; i++) if (n % i == 0) return i + minSteps(n / i); return n; }原创 2017-11-14 20:53:06 · 138 阅读 · 0 评论 -
Leetcode: 712. Minimum ASCII Delete Sum for Two Strings
c++(O(n)):class Solution {public: int minimumDeleteSum(string s1, string s2) { int m = s1.size(), n = s2.size(); vector<int> dp(n+1, 0); for (int j = 1; j <= n; j++)原创 2017-11-14 20:51:12 · 181 阅读 · 0 评论 -
[Leetcode]516. Longest Palindromic Subsequence
c++代码:class Solution {public: int longestPalindromeSubseq(string s) { int n = s.size(); int dp[n][n] = {0}; for (int i = n - 1; i >= 0; --i) { dp[i][i] = 1;原创 2017-10-25 22:23:05 · 202 阅读 · 0 评论 -
Leetcode:378. Kth Smallest Element in a Sorted Matrix
算法:使用nth_number()函数class Solution {public: int kthSmallest(vector<vector<int>>& matrix, int k) { int row=matrix.size(); int col=matrix[0].size(); int* number = new int[原创 2017-10-14 21:00:56 · 229 阅读 · 0 评论 -
Leetcode: 454. 4Sum II
算法:先将AB的所有组合计算出来存进map中,然后在与所有的CD组合在map中使用count;class Solution {public: int fourSumCount(vector<int>& A, vector<int>& B, vector<int>& C, vector<int>& D) { std::map<int, int> map; in原创 2017-10-14 20:48:11 · 234 阅读 · 0 评论 -
Leetcode: 402. Remove K Digits
c++代码:class Solution {public: string removeKdigits(string num, int k) { string ANS; int keep = num.size() - k; for (int i=0; i<num.size(); i++) {原创 2017-10-29 23:51:26 · 236 阅读 · 0 评论 -
Leetcode:215. Kth Largest Element in an Array
题意:即相当于第n - k +1大的数!下面放出代码:class Solution {public: int findKthLargest(vector<int>& nums, int k) { int L = 0, R = nums.size() - 1; while (L < R) { int left = L, right =原创 2017-10-04 20:35:23 · 158 阅读 · 0 评论 -
Leetcode: 50 Pow(x,n)
题意:即求实数x的n次幂。 先将解题代码放出:class Solution {public: double myPow(double x, int n) { if( n == 0) return 1.00000; double z = x - 0 > 0 ? x : -x; if(z - 1 > 0 && n < -1原创 2017-09-17 22:33:01 · 186 阅读 · 0 评论 -
Leetcode :2 Add Two Numbers
LEETCODE: 题意理解:也就是给定两个非空链表,然后按照十进制加法处理这两个链表并存入一个新链表中。先将解题代码放上:class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode* l3; ListNode* old; bo原创 2017-09-10 19:32:50 · 164 阅读 · 0 评论 -
【leetcode】3. Longest Substring Without Repeating Characters
c++:class Solution {public: int lengthOfLongestSubstring(string s) { vector dict(256, -1); int maxLen = 0, start = -1; for (int i = 0; i != s.length(); i++) {原创 2018-01-13 22:37:38 · 209 阅读 · 0 评论