计算机红利

分类

题解(29)

/ 注册

全部文章（共29篇）

题解 | #栈的压入、弹出序列#

class Solution { public: bool IsPopOrder(vector pushV,vector popV) { if(pushV.size() == 0 || popV.size() == 0 || pushV.size() != popV.size()) { return...

C++

2022-03-23

1 361

题解 | #链表中倒数第k个结点#

/* struct ListNode { int val; struct ListNode next; ListNode(int x) : val(x), next(NULL) { } };/ class Solution { public: ListNode* FindKthToTail(List...

C++

2022-01-31

0 392

题解 | #斐波那契数列#

class Solution { private: unordered_map<int,int> m; public: int Fibonacci(int n) { if(n == 1 || n == 2) { return 1; } int pre = 0; if(m.find(n -...

C++

2022-01-31

0 358

题解 | #数组中出现次数超过一半的数字#

class Solution { //时间复杂度为o(n)，说明排序是不行的 //排序思想，出现最多的数字一定是在中间的，然后检测中间的数字就可以了 public: int MoreThanHalfNum_Solution(vector numbers) { int number = numbers...

C++

2022-01-28

0 348

题解 | #二叉树遍历#

#include<stdio.h> #include<stdlib.h> typedef struct TreeNode{ struct TreeNodeleft; struct TreeNoderight; char data; }TreeNode; TreeNode* T...

C

2021-12-15

0 447

题解 | #X形图案#

#include<stdio.h> int main() { int n; int i,j; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { ...

C

2021-10-13

0 365

题解 | #反斜线形图案#

#include<stdio.h> int main() { int n; int i,j; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { ...

C

2021-10-13

0 344

题解 | #箭形图案#

#include<stdio.h> int main() { int n; int i,j,x; while(scanf("%d",&n)!=EOF) { for(i=0;i<=n;i++) { ...

C

2021-10-13

1 448

题解 | #菱形图案#

#include<stdio.h> int main() { int n; int i,j,x; while(scanf("%d",&n)!=EOF) { for(i=0;i<=n;i++) { ...

C

2021-10-13

0 340

题解 | #翻转金字塔图案#

#include<stdio.h> int main() { int n; while(scanf("%d",&n)!=EOF) { int i,j,m; for(i=0;i<n;i++) { ...

C

2021-10-13

0 359