Young__Yang0508

分类

/ 注册

全部文章（共93篇）

题解 | 分糖果问题

// a little hard. class Solution { public: int candy(vector<int>& arr) { int ans = 0; vector<int>a(arr.size(), 1);...

2026-04-24

0 29

题解 | 用两个栈实现队列

//No more easier than it. class Solution { public: void push(int node) { stack1.push(node); } int pop() { while(!stack1.e...

2026-04-23

0 23

题解 | 比较版本号

//No more easier than it. class Solution { public: int compare(string version1, string version2) { int l1 = 0, l2 = 0; int num1 = ...

2026-04-23

0 21

题解 | 旋转数组的最小数字

class Solution { public: int minNumberInRotateArray(vector<int>& nums) { int l = 0, r = nums.size() - 1; while(l < r)...

2026-04-23

0 23

题解 | 寻找峰值

class Solution { public: int findPeakElement(vector<int>& nums) { int l = 0; int r = nums.size() - 1; if (nums...

2026-04-22

0 31

题解 | 二维数组中的查找

class Solution { public: bool Find(int target, vector<vector<int> >& array) { set<int>st; for (int i = 0; ...

2026-04-22

0 35

题解 | 二分查找-I

class Solution { public: int search(vector<int>& nums, int target) { int l = 0; int r = nums.size() - 1; if(nums...

2026-04-22

0 27

题解 | 最长不下降子序列

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int>a; for(int i = 0; i < n;...

2026-03-11

0 63

题解 | 小红的地砖

#include <stdio.h> #include <stdlib.h> int min(int a, int b){ return a > b ? b : a; } int main(void) { int n; scanf("...

2026-03-11

0 51

题解 | 迷宫问题

#include <stdio.h> int main(void) { int h, w; scanf("%d%d", &h, &w); char ch[105][105]; for (int i = 0; i &l...

2026-03-09

0 55