gs

参考文章：https://blog.youkuaiyun.com/w_linux/article/details/76222112

1、输入数据包括多组。每组数据一行,每行的第一个整数为整数的个数n(1 <= n <= 100), n为0的时候结束输入。接下来n个正整数,即需要求和的每个正整数。#include<iostream>using namespace std;int main(){ int n; while (cin >> n) { if (n == 0) br...

//判断是否是环形链表（141）class Solution {public: bool hasCycle(ListNode *head) { ListNode *fast = head, *slow = head; while(fast && fast->next){ slow = slow->nex...

int main() { vector<vector<int>> dp(5, vector<int>(10,3)); //创建5*10二维数组 dp.push_back(vector<int>(10,5)); //添加一行，成为了6*10数组 dp[4][3] = 100; ...

以下代码都来自该博客：博客链接：https://www.cnblogs.com/grandyang/p/4606334.html一、回文串相关//验证是否为回文字符串（125）class Solution {public: bool isPalindrome(string s) { int left = 0, right = s.size() - 1 ; ...

参考博客：https://blog.youkuaiyun.com/zhy_cheng/article/details/8090346使用标准库的栈和队列时，先包含相关的头文件#include<stack>#include<queue>栈和队列的定义如下：stack<int> stk;queue<int> q;queue<TreeNode*...

参考文章：https://blog.youkuaiyun.com/dyx404514/article/details/42061017参考文章：https://www.cnblogs.com/grandyang/p/4475985.html#include <vector>#include <iostream>#include <string>using na...

递归实现//二叉树的定义struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution {public: vector<int&gt...

#include<iostream>#include<vector>using namespace std;void quicksort(vector<int> &nums ,int left, int right) { if (left > right) { return; } int i = left, j = right, ...

C++ 实现冒泡排序#include<iostream>#include<vector>using namespace std;void bubblesort(vector<int> &nums) { int i = 0, j = 0 , temp = 0; for (int i = 0; i < nums.size(); i++) ...

参考文章：https://blog.youkuaiyun.com/BillCYJ/article/details/78985895

针对问题：将浮点数取整或者四舍五入注意函数取整返回值均为double型，在用printf输出时应注意使用函数实现需要添加一个头文件#include<iostream>#include<cmath>using namespace std;int main(){ double m=3.5; cout<<ceil(m)<<en...

#include<iostream>#include<algorithm>using namespace std;int solve(int n) { if (n == 0) return 1; else if (n < 10) return n; else return max(solve(n / 10) * (n % 10), solve(n / 1...