高天翱翔666

分类

题解(3)

/ 注册

全部文章（共36篇）

题解 | 机器翻译

#include<iostream> using namespace std;int x,m,t,r[1000],v[1000]; int main(){ for(cin>>m>>x;cin>>x;) if(!v[x])if(v...

2025-08-17

0 16

题解 | 参议院投票

class Solution { public: string predictVictory(string s){int S=0; for(auto c:s)S+=c=='D'?-1:1; return S>0||(s[0]=='R'&&...

2025-08-17

0 16

题解 | 用两个栈实现队列

class Solution { public: void push(int n){s.push(n); } int pop(){int a; if(S.empty())for(;s.size();s.pop()) S.push(s.top()...

2025-08-17

0 12

题解 | 队列消数

class Solution { public: int timeRequiredToBuy(vector<int>&t,int k) { int i=0,s=0;for(int a:t) s+=min(t[k]-(i++>k...

2025-08-17

0 16

题解 | 验证栈序列

#include<bits/stdc++.h> using namespace std;int n,i,j,a[100005],b[100005]; int main(){for(cin>>n;cin>>n;){ for(i=0;i<n;)c...

2025-08-15

0 15

题解 | 栈和排序

#include<bits/stdc++.h> using namespace std; int n,i,t,a[1000005],m[1000005],s[1000005]; int main(){for(cin>>n;i++<n;)cin>>a[i]; ...

2025-08-15

0 17

题解 | 表达式求值

class Solution { public: int solve(string s) { int S=0,n=0,i=0,N=0,C,l;char k='+'; for(;i<s.size();i++){ if(isdigit...

2025-08-15

0 17

题解 | 有效括号序列

class Solution { public: bool isValid(string s){ stack<char>S;for(auto c:s) if(S.empty())S.push(c); else{cha...

2025-08-15

0 18

题解 | 向量点乘

class Solution { public: int dotTime(vector<int>& vector1, vector<int>& vector2) { return vector1[0]*vector2[0]+vector...

2025-08-15

0 14

题解 | 求峰谷点数

#include <fstream> class Solution { public: int countPeakPoint(vector<int>& a) { int S=0,i=0; for(;++i<a.size()...

2025-08-15

0 22