weixin_39558227的博客

01背包为何压缩后要逆序如下图所示 为01背包压缩的模式for (int i = 1; i <= n; i++) for (int j = V; j >= 0; j--) f[j] = max(f[j], f[j - w[i]] + v[i]);这里用别的博客的一张图的例子，图中是二维的情况，比较简单不做赘述我这边手绘了一个表格来表示1维的情况...

#include<iostream>#include<vector>#include<string>#include<map>using namespace std;class Solution {public: string intToRoman(int num) { int values[] = { 1000, 900, 5...

双指针法#include<iostream>#include<vector>#include "pch.h"using namespace std;class Solution {public: int maxArea(vector<int>& height) { int length = height.size(); int ...

分情况讨论：这里我们不去讨论能不能匹配上，重点关注当前字符后面有*没有*的回溯情况，用一个当前字符是否匹配上作为回溯标记，用index是否等于待匹配字符长度作为回溯终止条件。后面有星号有两种可能，一是要取到当前字符但是因为待匹配字符后面有星号所以待匹配字符的index并不后移继续进行匹配因为它能匹配1个或多个相同字符，二是跳过当前字符和后面的星号#include "pch.h"#incl...

#include "pch.h"#include<vector>#include<string>#include<iostream>using namespace std;#include<algorithm>class Solution {public: bool isPalindrome(int x) { if (x &...

// leetcode.cpp : This file contains the 'main' function. Program execution begins and ends there.//#include "pch.h"#include<vector>#include<string>#include<iostream>using n...

思路就是把一个数字的最后一位提取放到第一位，知道用尽该数的每一位数利用%和/符号#include "pch.h"#include<vector>#include<string>#include<iostream>using namespace std;class Solution {public: int reverse(int x) {...

class Solution {public: string convert(string s,int numRows) { if (numRows == 1) { return s; } int sSize = s.size(); int storeSize = min(sSize, numRows); vector<string> st...

class Solution {public:ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { int a = 0, b = 0; int carryBit = 0; //进位变量 ListNode *result = new ListNode(0); //增添头结点，方便操作 ListNode *current...

// leetcode.cpp : This file contains the 'main' function. Program execution begins and ends there.//#include "pch.h"#include<vector>#include<string>#include<iostream>using nam...