C++ string 类模拟实现：从浅拷贝到深拷贝的深度解析

就像一个家庭中有两个孩子，但父母只买了一份玩具，两个孩子愿意一块玩，则万事大吉，万一不想分享就你争我夺，玩具损坏。

深拷贝解决方案

如果一个类中涉及到资源的管理，其拷贝构造函数、赋值运算符重载以及析构函数必须要显式给出。一般情况都是按照深拷贝方式提供，即每个对象都有一份独立的资源，不要和其他对象共享。

核心功能模拟实现

构造函数的现代写法

传统写法是直接分配内存并拷贝数据，而现代写法利用临时对象和交换语义来简化逻辑，减少重复代码。

// 传统写法
/*
string(const string& s) { 
    _str = new char[s._capacity + 1]; 
    strcpy(_str, s._str); 
    _size = s._size; 
    _capacity = s._capacity; 
} 
*/

// 现代写法：利用 swap 优化
string(const string& s) {
    string tmp(s._str); // 默认构造
    swap(tmp);          // 把 tmp 和当前对象交换
}

赋值运算符重载

赋值操作需要处理自赋值的情况，同时尽量降低开销。这里采用传值参数配合 swap 的方式，既安全又高效。

// s1=s3
// 最新版本的赋值：传值构造 + swap
string& operator=(string tmp) {
    swap(tmp);
    return *this;
}

注意：拷贝构造必须用引用，不然会无穷递归，但赋值不用，因为我们需要构造一个临时副本。

析构函数

清理资源是析构函数的职责，记得将指针置空，防止悬垂指针。

~string() {
    delete[] _str;
    _str = nullptr;
    _capacity = _size = 0;
}

常用成员函数实现

clear

清空字符串内容，重置大小。

void clear() {
    _str[0] = '\0';
    _size = 0;
}

reserve

预留空间，避免频繁扩容带来的性能损耗。注意永远多开一个空间存放结束符 。

void string::reserve(size_t n) {
    if (n > _capacity) {
        char* tmp = new char[n + 1];
        strcpy(tmp, _str);
        delete[] _str;
        _str = tmp;
        _capacity = n;
    }
}

push_back

插入单个字符。如果空间不足，先扩容再插入。

void string::push_back(char ch) {
    if (_size == _capacity)
        reserve(_capacity == 0 ? 4 : _capacity * 2);
    _str[_size] = ch;
    ++_size;
    _str[_size] = '\0';
}

append

追加字符串。同样需要先检查容量。

void string::append(const char* str) {
    size_t len = strlen(str);
    if (_size + len > _capacity)
        reserve(_size + len > _capacity * 2 ? _size + len : _capacity * 2);
    strcpy(_str + _size, str);
    _size += len;
}

insert

插入字符或字符串。涉及大量内存移动，需要注意边界条件。

void string::insert(size_t pos, char ch) {
    assert(pos <= _size);
    if (_size == _capacity)
        reserve(_capacity == 0 ? 4 : _capacity * 2);
    size_t end = _size + 1;
    while (end > pos) {
        _str[end] = _str[end - 1];
        --end;
    }
    _str[pos] = ch;
    ++_size;
}

void string::insert(size_t pos, const char* str) {
    assert(pos <= _size);
    size_t len = strlen(str);
    if (_size + len > _capacity)
        reserve(_size + len > _capacity * 2 ? _size + len : _capacity * 2);
    size_t end = _size + len;
    if (len == 0) return;
    while (end > pos + len - 1) {
        _str[end] = _str[end - len];
        --end;
    }
    for (size_t i = 0; i < len; ++i)
        _str[pos + i] = str[i];
    _size += len;
}

erase

删除指定位置的字符或子串。

void string::erase(size_t pos, size_t len) {
    assert(pos < _size);
    if (len > _size - pos) {
        _str[pos] = '\0';
        _size = pos;
    } else {
        for (size_t i = pos + len; i <= _size; i++)
            _str[i - len] = _str[i];
        _size -= len;
    }
}

find & substr

查找与截取子串。

size_t string::find(char ch, size_t pos) {
    for (size_t i = pos; i < _size; i++) {
        if (_str[i] == ch)
            return i;
    }
    return npos;
}

size_t string::find(const char* str, size_t pos) {
    assert(pos < _size);
    const char* ptr = strstr(_str + pos, str);
    if (ptr == nullptr)
        return npos;
    else
        return ptr - _str;
}

string string::substr(size_t pos, size_t len) {
    assert(pos < _size);
    if (len > _size - pos)
        len = _size - pos;
    string sub;
    sub.reserve(len);
    for (size_t i = 0; i < len; ++i)
        sub += _str[pos + i];
    return sub;
}

比较运算符

利用 strcmp 进行底层比较。

bool operator<(const string& s1, const string& s2) {
    return strcmp(s1.c_str(), s2.c_str()) < 0;
}
bool operator==(const string& s1, const string& s2) {
    return strcmp(s1.c_str(), s2.c_str()) == 0;
}
bool operator>(const string& s1, const string& s2) {
    return !(s1 < s2 || s1 == s2);
}
bool operator<=(const string& s1, const string& s2) {
    return s1 < s2 || s1 == s2;
}
bool operator>=(const string& s1, const string& s2) {
    return !(s1 < s2);
}
bool operator!=(const string& s1, const string& s2) {
    return !(s1 == s2);
}

流插入与提取

支持 cout 和 cin 操作。

ostream& operator<<(ostream& out, const string& s) {
    for (auto ch : s)
        out << ch;
    return out;
}

istream& operator>>(istream& in, string& s) {
    s.clear();
    const int N = 256;
    char buff[N];
    int i = 0;
    char ch;
    ch = in.get();
    while (ch != ' ' && ch != '\n') {
        buff[i++] = ch;
        if (i == N - 1) {
            buff[i] = '\0';
            s += buff;
            i = 0;
        }
        s += ch;
        ch = in.get();
        if (i > 0) {
            buff[i] = '\0';
            s += buff;
        }
    }
    return in;
}

完整代码结构

string.h

#pragma once
#include <iostream>
#include <assert.h>
#include <string.h>
using namespace std;

namespace bit {
class string {
public:
    typedef char* iterator;
    iterator begin() { return _str; }
    iterator end() { return _str + _size; }
    typedef const char* const_iterator;
    const_iterator begin() const { return _str; }
    const_iterator end() const { return _str + _size; }

    size_t capacity() const { return _capacity; }
    void reserve(size_t n);
    void push_back(char ch);
    void append(const char* str);
    string& operator+=(char ch);
    string& operator+=(const char* str);
    void insert(size_t pos, char ch);
    void insert(size_t pos, const char* str);
    void erase(size_t pos, size_t len = npos);
    size_t find(char ch, size_t pos = 0);
    size_t find(const char* str, size_t pos = 0);
    string substr(size_t pos = 0, size_t len = npos);

    string(const char* str = "") {
        _size = strlen(str);
        _capacity = _size;
        _str = new char[_capacity + 1];
        strcpy(_str, str);
    }

    string(const string& s) {
        string tmp(s._str);
        swap(tmp);
    }

    string& operator=(string tmp) {
        swap(tmp);
        return *this;
    }

    void swap(string& s) {
        std::swap(_str, s._str);
        std::swap(_size, s._size);
        std::swap(_capacity, s._capacity);
    }

    ~string() {
        delete[] _str;
        _str = nullptr;
        _capacity = _size = 0;
    }

    void clear() {
        _str[0] = '\0';
        _size = 0;
    }

    const char* c_str() const { return _str; }
    size_t size() const { return _size; }
    char& operator[](size_t pos) {
        assert(pos < _size);
        return _str[pos];
    }
    const char& operator[](size_t pos) const {
        assert(pos < _size);
        return _str[pos];
    }

private:
    char* _str = nullptr;
    size_t _size = 0;
    size_t _capacity = 0;
    static const size_t npos = -1;
};
}

string.cpp

#include "string.h"
namespace bit {
void string::reserve(size_t n) {
    if (n > _capacity) {
        char* tmp = new char[n + 1];
        strcpy(tmp, _str);
        delete[] _str;
        _str = tmp;
        _capacity = n;
    }
}

void string::push_back(char ch) {
    if (_size == _capacity)
        reserve(_capacity == 0 ? 4 : _capacity * 2);
    _str[_size] = ch;
    ++_size;
    _str[_size] = '\0';
}

string& string::operator+=(char ch) {
    push_back(ch);
    return *this;
}

void string::append(const char* str) {
    size_t len = strlen(str);
    if (_size + len > _capacity)
        reserve(_size + len > _capacity * 2 ? _size + len : _capacity * 2);
    strcpy(_str + _size, str);
    _size += len;
}

string& string::operator+=(const char* str) {
    append(str);
    return *this;
}

void string::insert(size_t pos, char ch) {
    assert(pos <= _size);
    if (_size == _capacity)
        reserve(_capacity == 0 ? 4 : _capacity * 2);
    size_t end = _size + 1;
    while (end > pos) {
        _str[end] = _str[end - 1];
        --end;
    }
    _str[pos] = ch;
    ++_size;
}

void string::insert(size_t pos, const char* str) {
    assert(pos <= _size);
    size_t len = strlen(str);
    if (_size + len > _capacity)
        reserve(_size + len > _capacity * 2 ? _size + len : _capacity * 2);
    size_t end = _size + len;
    if (len == 0) return;
    while (end > pos + len - 1) {
        _str[end] = _str[end - len];
        --end;
    }
    for (size_t i = 0; i < len; ++i)
        _str[pos + i] = str[i];
    _size += len;
}

void string::erase(size_t pos, size_t len) {
    assert(pos < _size);
    if (len > _size - pos) {
        _str[pos] = '\0';
        _size = pos;
    } else {
        for (size_t i = pos + len; i <= _size; i++)
            _str[i - len] = _str[i];
        _size -= len;
    }
}

size_t string::find(char ch, size_t pos) {
    for (size_t i = pos; i < _size; i++) {
        if (_str[i] == ch)
            return i;
    }
    return npos;
}

size_t string::find(const char* str, size_t pos) {
    assert(pos < _size);
    const char* ptr = strstr(_str + pos, str);
    if (ptr == nullptr)
        return npos;
    else
        return ptr - _str;
}

string string::substr(size_t pos, size_t len) {
    assert(pos < _size);
    if (len > _size - pos)
        len = _size - pos;
    string sub;
    sub.reserve(len);
    for (size_t i = 0; i < len; ++i)
        sub += _str[pos + i];
    return sub;
}

void test_string1() {
    string s1;
    string s2("hello world");
    cout << s1.c_str() << endl;
    cout << s2.c_str() << endl;
    for (size_t i = 0; i < s2.size(); ++i)
        s2[i] += 2;
    cout << s2.c_str() << endl;
    for (auto e : s2)
        cout << e << " ";
    cout << endl;
    string::iterator it = s2.begin();
    while (it != s2.end()) {
        cout << *it << " ";
        ++it;
    }
}

void test_string2() {
    string s1("hello wwww");
    s1 += 'x';
    cout << s1.c_str() << endl;
    s1.insert(3, "sss");
    cout << s1.c_str() << endl;
    s1.erase(3, 2);
    cout << s1.c_str() << endl;
}

void test_string3() {
    string s("666.cpp.zip");
    size_t pos = s.find('.');
    string suffix = s.substr(pos);
    cout << suffix.c_str() << endl;
    string copy(s);
    cout << copy.c_str() << endl;
}

bool operator<(const string& s1, const string& s2) {
    return strcmp(s1.c_str(), s2.c_str()) < 0;
}
bool operator==(const string& s1, const string& s2) {
    return strcmp(s1.c_str(), s2.c_str()) == 0;
}
bool operator>(const string& s1, const string& s2) {
    return !(s1 < s2 || s1 == s2);
}
bool operator<=(const string& s1, const string& s2) {
    return s1 < s2 || s1 == s2;
}
bool operator>=(const string& s1, const string& s2) {
    return !(s1 < s2);
}
bool operator!=(const string& s1, const string& s2) {
    return !(s1 == s2);
}

ostream& operator<<(ostream& out, const string& s) {
    for (auto ch : s)
        out << ch;
    return out;
}

istream& operator>>(istream& in, string& s) {
    s.clear();
    const int N = 256;
    char buff[N];
    int i = 0;
    char ch;
    ch = in.get();
    while (ch != ' ' && ch != '\n') {
        buff[i++] = ch;
        if (i == N - 1) {
            buff[i] = '\0';
            s += buff;
            i = 0;
        }
        s += ch;
        ch = in.get();
        if (i > 0) {
            buff[i] = '\0';
            s += buff;
        }
    }
    return in;
}

void test_string4() {
    string s1("hello");
    cin >> s1;
    cout << s1 << endl;
    cout << "he";
}

int main() {
    bit::test_string4();
    return 0;
}
}