zoukankan      html  css  js  c++  java
  • 现代程序设计——homework-09

    Lambda表达式

    // homework-09.cpp : 定义控制台应用程序的入口点。
    //
    
    #include "stdafx.h"
    #include <iostream>
    #include <string>
    #include <memory>
    using namespace std;
    template<typename Func>
    int alNum(char* ins,char alp,Func func){
    int count=0;
    int i=0;
    int len=strlen(ins);
    for(;i<len;i++)
    if(func(ins[i],alp))
    count++;
    return count;
    }
    int _tmain(int argc, _TCHAR* argv[])
    {
    unique_ptr<char[]> ins(new char[81]);
    gets(ins.get());
    auto func=[](char ina, char coma){return ina==coma;};
    char al;
    al='e';
    cout<<"Num of:"<<al<<"
    "<<alNum(ins.get(),al,func)<<"
    ";
    al='l';
    cout<<"Num of:"<<al<<"
    "<<alNum(ins.get(),al,func)<<"
    ";
    system("pause");
    return 0;
    }
    View Code

    智能指针使用

    #include "stdafx.h"
    #include <iostream>
    #include <string>
    #include <memory>
    using namespace std;
    unique_ptr<char[]> moveRight ( char* ins,int n){
    int len = strlen(ins);
    n%=len;
    unique_ptr<char[]> temps(new char[len+1]);
    strncpy(temps.get()+len-n,ins,n);
    strncpy(temps.get(),ins+n,len-n);
    temps[len]='';
    return temps;
    }
    int _tmain(int argc, _TCHAR* argv[])
    {
    int n;
    cin>>n;
    unique_ptr<char[]> ins(new char[81]);
    cin>>ins.get();
    ins = moveRight(ins.get() , n);
    cout<<ins.get();
    system("pause");
    return 0;
    }
    View Code
  • 相关阅读:
    [JSOI2008]巨额奖金(最小生成树计数)
    [HAOI2008] 糖果传递
    [SCOI2009]生日快乐
    BZOJ2821 作诗
    [HAOI2008]圆上的整点
    POJ1741
    AC自动机
    [JSOI2008]星球大战starwar
    二分图有关证明(感性版)
    初识Pentaho(一)
  • 原文地址:https://www.cnblogs.com/hennande/p/3441211.html
Copyright © 2011-2022 走看看