
简介
该用户还未填写简介
擅长的技术栈
未填写擅长的技术栈
可提供的服务
暂无可提供的服务
c++实现盛最多水的容器
#include<algorithm>class Solution {public:int maxArea(vector<int>& height) {int i=0,j=height.size()-1,mx=0;while(i<j){if(height[i]<height[j]){mx=max(mx,heig.
c++实现复数相加
#include <iostream>#include <cmath>using namespace std;class fs{public:int x = 0, y = 0;fs(){}fs(string s){int m = 0, flag = 1, k = s.size();for(int i = 0; i < k; i++){if(s[i] =.
c++实现整数转罗马数字
#include <string>class Solution {public:string intToRoman(int num) {string arr1[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};int nums[]={1000,900,500,400,100,90,50,40,10,9,5,4,1
到底了







