算法
征路遥
美团点评现役码农
展开
-
两栈实现队列
class Solution{public: void push(int node) {stack1.push(node);}int pop() {while(!stack1.empty()){stack2.push(stack1.top());stack1.pop();}int re=stack2.top();stack2.pop();原创 2017-10-05 10:16:55 · 161 阅读 · 0 评论 -
换空格问题
剑指offer换空格class Solution {public:void replaceSpace(char *str,int length) {for(int i=0;i{if(str[i]==' '){for(int j=length-1;j>i;j--){str[j+2]=str[j];}str[i]='%';str[i+1]='2'原创 2017-10-05 10:20:17 · 144 阅读 · 0 评论 -
m选n组合问题
#include #includeusing namespace std;int cnt=0;string a[10]={"xie","wang","song","guo","liu","he","1","2","3","4"};//全局变量,便于变量函数间操作void printv(vector &v)//输出函数{for(int i=0;i{cout原创 2017-10-05 10:21:14 · 379 阅读 · 1 评论 -
递归求sum
#include using namespace std;int sum1=0;int sum(int n,int m){if(m!=n){sum1=sum(n,m-1)+m;}if(m==n){sum(n,m-1)=n;}}int main(){cout}原创 2017-10-05 10:22:34 · 967 阅读 · 0 评论