c++沉思录中 对字符串进行围边 横向连接 竖向连接操作的练习

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
// MyPics.cpp : 定义控制台应用程序的入口点。
//
 
#include "stdafx.h"
#include <string>
#include <iostream>
#include <vector>
 
using namespace std;
 
string::size_type width(const vector<string>& v)
{
    string::size_type maxLen = 0;
    for (vector<string>::const_iterator it = v.begin(); it != v.end(); it++) {
        if (maxLen < it->size())
            maxLen = it->size();
    }
    return maxLen;
}
 
 
vector<string> frame(const vector<string>& p) {
    vector<string> v;
    string::size_type maxLen = width(p);
    string s(maxLen + 4, '*');
    v.push_back(s);
    for (vector<string>::const_iterator it = p.begin();
        it != p.end(); it++){
        v.push_back("* " + *it + string(maxLen - it->size(),' ') + " *");
    }
    v.push_back(s);
 
    return v;
}
 
vector<string> hcat(const vector<string>& right,
    const vector<string>& left) {
    vector<string> v;
    string::size_type rightMaxLen = width(right);
    int index = 0;
    while (index < right.size() || index < left.size()) {
        string s;
        if (index < right.size()) {
            s = right[index];
            s += string(rightMaxLen - right[index].size(),' ' );
        }
        else
            s = string(rightMaxLen,' ');
 
        if (index < left.size())
            s += left[index];
         
        index++;
        v.push_back(s);
    }
 
    return v;
}
 
vector<string> vcat(const vector<string>& top,
    const vector<string>& bottom) {
    vector<string> v = top;
    for (vector<string>::const_iterator it = bottom.begin();
        it != bottom.end(); it++)
    {
        v.push_back(*it);
    }
     
    return v;
}
 
 
 
 
int main()
{
    vector<string> p;
    p.push_back("this is an");
    p.push_back("example");
    p.push_back("to");
    p.push_back("illustrate");
    p.push_back("framing");
 
    vector<string> v = frame(p);
    for (vector<string>::const_iterator it = v.begin();
        it != v.end(); it++) {
        std::cout << *it << std::endl;
    }
    std::cout << std::endl << std::endl;
 
    v.clear();
    v = vcat(p,frame(p));
    for (vector<string>::const_iterator it = v.begin();
        it != v.end(); it++) {
        std::cout << *it << std::endl;
    }
 
    std::cout << std::endl << std::endl;
 
    v.clear();
    v = hcat(p, frame(p));
    for (vector<string>::const_iterator it = v.begin();
        it != v.end(); it++) {
        std::cout << *it << std::endl;
    }
 
    std::cout << std::endl << std::endl;
 
    v.clear();
    v = hcat(frame(p),p);
    for (vector<string>::const_iterator it = v.begin();
        it != v.end(); it++) {
        std::cout << *it << std::endl;
    }
 
    return 0;
}

  

posted on   itdef  阅读(395)  评论(0编辑  收藏  举报

编辑推荐:
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
阅读排行:
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 按钮权限的设计及实现
· 25岁的心里话

导航

< 2025年3月 >
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

统计

点击右上角即可分享
微信分享提示