辣椒酱up

分类

/ 注册

全部文章（共60篇）

题解 | #数组中只出现一次的两个数字#

#include <vector> class Solution { public: vector<int> FindNumsAppearOnce(vector<int>& nums) { int n = nums.size()...

2024-03-05

0 189

题解 | #跳台阶#

class Solution { public: int jumpFloor(int number) { if(number == 1) return 1; else if(number == 2) return 2; else ...

2024-03-05

0 158

题解 | #扑克牌顺子#

#include <locale> class Solution { public: bool IsContinuous(vector<int>& numbers) { sort(numbers.begin(), numbers.end());...

2024-03-05

0 230

题解 | #斐波那契数列#

class Solution { public: int Fibonacci(int n) { if(n == 1 || n == 2) return 1; else return Fibonacci(n - 1) +Fibonacci(n -2...

2024-03-04

0 188

题解 | #有效括号序列#

class Solution { public: bool isValid(string s) { int n = s.size(); if(n % 2 != 0 ) return false; stack<char> sta...

2024-03-04

0 186

题解 | #最长公共前缀#

class Solution { public: string longestCommonPrefix(vector<string>& strs) { // write code here int n = strs.size(); ...

2024-03-04

0 171

题解 | #没有重复项数字的全排列#

#include <vector> class Solution { public: void dfs(vector<vector<int>> & ans, vector<int> temp, vector<bool> vi...

2024-03-04

0 181

题解 | #有重复项数字的全排列#

#include <unordered_set> #include <vector> class Solution { public: void dfs(vector<vector<int>> & ans, vector<bool...

2024-03-04

0 186

题解 | #合并区间#

/** * struct Interval { * int start; * int end; * Interval(int s, int e) : start(start), end(e) {} * }; */ #include <vector> class Solutio...

2024-03-03

0 164

题解 | #在两个长度相等的排序数组中找到上中位数#

class Solution { public: int findMedianinTwoSortedAray(vector<int>& arr1, vector<int>& arr2) { // write code here ...

2024-03-03

0 168