rsy56640的博客

等有空了研究一下置换群 感觉可以直接给出序列表示 下面是暴力#include <iostream>#include <iterator>using namespace std;ostream_iterator<int> _oit(cout, " ");int _count = 0;bool judge(int* p, int pos, int m) { for (int i = 0

题目链接：https://leetcode.com/problems/longest-valid-parentheses/description/ 要考试了，做点水题保平安（）class Solution {public: int longestValidParentheses(string s) { int size = s.size(); stack<

题目链接：https://leetcode.com/problems/top-k-frequent-words/description/template&amp;amp;lt;class _Ty1, class _Ty2&amp;amp;gt;struct MyPairLess{ typedef _Ty1 first_argument_type; typedef _Ty2 second_argumen...

这我也是醉了map<int, string>mp[3];map<int, string>mmp;class Solution {private: void add(string& s, int& num) { int x[3]; for (int i = 0; i < 3; ++i) { x[i] = num % 10;

题目链接：https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/注：下面给的这个不能AC，因为有一组数据是INT_MIN。。把第一个人工记录就好了。贴这个是因为风格比较标准。(略微改了一下，现在可以AC)class Solution {public: int findMinArr...

题目链接：http://www.lintcode.com/zh-cn/problem/interval-sum-ii/#class Solution { class SegmentTreeNode { public: int start, end, sum; SegmentTreeNode *left, *right; SegmentTreeNode(int start, int...

https://github.com/rsy56640/rsy_little_lib/tree/master/library_for_algorithm/SegmentTree指针实现class SegmentTree { class SegmentTreeNode { public: int start, end, val; Segm...

题目链接：https://leetcode.com/problems/largest-rectangle-in-histogram/description/https://www.youtube.com/watch?v=VNbkzsnllsU&amp;t=369sclass Solution {public: int largestRectangleArea(vector&lt;int&gt;...

行策课没事干，和晨哥窜通一下，打打周赛暖暖手。感觉好久都没写代码了。。832 Flipping an Image 题目链接： https://leetcode.com/contest/weekly-contest-84/problems/flipping-an-image/class Solution {public: vector&lt;vector&lt;int&gt;&...

题目链接：https://leetcode.com/problems/top-k-frequent-words/description/templatestruct MyPairLess { typedef _Ty1 first_argument_type; typedef _Ty2 second_argument_type; typedef bool result_type; cons

题目链接：https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/struct point { int ary, col; explicit point(int x, int y) :ary(x), col(y) {} point operator++(int) {

题目链接：https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/ 明天考试，水一水。。。。。。。。。题目大意：交替方向层次遍历一棵树struct TreeNode { int val; TreeNode *left; TreeNode *right; Tr

数学归纳法： 要反转部分的前一个当头，第一个当尾struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {}};class Solution {public: ListNode* reverseBetween(ListNode* head, int m, in

不知道说啥。。。。。 算是矮子里面拔将军吧。。。。 不过也就是初中思维（）class Solution {public: int totalHammingDistance(vector<int>& nums) { int total = 0; int size = nums.size(); for (int bit = 0; bit <

题目链接：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/ DP还没入门吧，过一段时间再来嘲笑现在的水平（逃class Solution {public: int maxProfit(vector<int>& prices, int fee) {

简单贪心：用RiR_i标记第ii步能到达的最右边位置.首先，Ri−1+1R_{i-1}+1到RiR_i都属于第i步可到达的位置. 事实上假设RiR_i上一步是xx，则xx属于第i−1i-1步可以到达的位置. 那么x≤Ri−1x\le R_{i-1}，并且xx可以到达x+1x+1到RiR_i， 故第ii步可以到达Ri−1+1R_{i-1}+1到RiR_i.其次，我们说Ri+1R_{i+1}可以由

题目链接：https://leetcode.com/problems/lfu-cache/description/这里写代码片

题目链接：https://leetcode.com/problems/lru-cache/discuss/ 非原创，来源于http://blog.csdn.net/qq508618087/article/details/50995188class LRUCache {public: LRUCache(int _capacity) :capacity(_capacity) {} i

题目链接：http://www.lintcode.com/zh-cn/problem/backpack-ii/ 2017.12.25 无事，水class Solution {public: /* * @param m: An integer m denotes the size of a backpack * @param A: Given n items with s

视频教程：MASM 在 VS 中的使用代码示例：https://pastebin.com/R4WJwfn0无法运行请参考：https://stackoverflow.com/a/4549741/8489782寄存器视图：调试-&gt;窗口-&gt;寄存器...