![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
Folivora懒懒
这个作者很懒,什么都没留下…
展开
-
leetcode1220 2022.1.17
class Solution { public: int countVowelPermutation(int n) { vector<long long int> dp; dp.resize(5, 1); int mod = 1000000007; for (int j = 1; j < n; j++) { long long int a = 0; lon原创 2022-01-17 11:09:49 · 129 阅读 · 1 评论 -
leetcode334 (2022.1.12)
bool increasingTriplet(vector<int>& nums) { int first, second, num; if (nums.size() < 3) { return false; } first = nums[0]; second = 0x7fffffff; for (int i = 1; i < nums.size(); i++) { if (nums[i] > second) { return true原创 2022-01-12 13:28:52 · 169 阅读 · 0 评论 -
leetcode1036(2022.1.11)
string vectorToString(vector<int> a) { if (a[0] < 0 || a[0] > 999999) { return ""; } if (a[1] < 0 || a[1] > 999999) { return ""; } string ans; ans = to_string(a[0]) + '|' + to_string(a[1]); return ans; } bool isEscapePossible原创 2022-01-11 13:11:51 · 400 阅读 · 2 评论 -
leetcode306 2022.1.10
#include <iostream> #include <algorithm> #include <vector> #include <string> using namespace std; string Add(string a1, string a2) { string resTrue; int len1 = a1.size(); int len2 = a2.size(); //处理进位 int x = 0; for (int i =原创 2022-01-10 19:42:03 · 145 阅读 · 0 评论 -
leetcode1629(2022.1.9)
char slowestKey(vector<int>& releaseTimes, string keysPressed) { char ans; int maxTime = releaseTimes[0]; ans = keysPressed[0]; for (int i = 1; i < keysPressed.size(); i++) { int tmp = releas原创 2022-01-09 10:15:26 · 138 阅读 · 0 评论 -
leetcode89 (2022.1.8)
vector<int> grayCode(int n) { vector<int> ans; ans.push_back(0); // 算法: 先将之前的序列取反,再把最高位弄成1即可 for (int i = 0; i < n; i++) { int len = ans.size(); for (int j = 0; j < len; j++) { ans.push_back(ans[len - j - 1] | (1 << i)原创 2022-01-08 15:56:45 · 416 阅读 · 0 评论 -
leetcode71 (2022.1.6)
class Solution { public: string simplifyPath(string path) { // 栈声明 vector<string> s; string tmp; //int ptr = 0; // 遍历字符串开始进行处理 for (int i = 0; i < path.size(); i++) { if (path原创 2022-01-06 10:49:35 · 375 阅读 · 0 评论 -
leetcode1576 (2022.1.5)
class Solution { public: char returnLegalCh(char s1, char s2) { int a = int(s1) - 97; int b = int(s2) - 97; //取下一个字符 int res = (a + 1) % 26; if (res == b) { res = (b + 1) % 26; }原创 2022-01-05 18:59:58 · 3262 阅读 · 0 评论 -
leetcode 913(2022 1.4)
const int MOUSE_WIN = 1; const int CAT_WIN = 2; const int DRAW = 0; const int MAXN = 51; class Solution { int n; int dp[MAXN * 2][MAXN][MAXN]; vector<vector<int>> g; public: int catMouseGame(vector<vector<int>>&原创 2022-01-04 18:04:41 · 151 阅读 · 0 评论 -
leetcode1185 (2022 1.3)
string dayOfTheWeek(int day, int month, int year) { int days = 0; int a = floor((year - 1969) / 4); days = (year - 1971) * 365 + a; vector<int> months = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; for(int i = 1; i < month; i+原创 2022-01-03 01:30:45 · 230 阅读 · 0 评论 -
leetcode390(2022 1.2)
int lastRemaining(int n) { //若n为奇数,start = n-1,偶数则为n if (n==1) return 1; int start = (n % 2 == 0) ? n : n - 1; int len = floor(n / 2); int ratio = -1; int i = 1; while (len > 1) {原创 2022-01-02 17:32:22 · 197 阅读 · 0 评论