#include <iostream>
#include <vector>
#include <algorithm>


void print(int n) {
    std::cout << n << " ";
}

int main() {
    // vector线性容器，类似数组，可以自动存储元素，自动增长和减小空间，可以被迭代
    int a[7] = {1, 2, 3, 4, 5, 6, 7};
    // iv(first:a,last:a+7)
    std::vector<...

#include <iostream>

int main() {
    char buffer[8];
    std::string s1("Test string ...");
    // s1.copy(容器,截取长度,开始下标)
    size_t len = s1.copy(buffer, 7, 5);
    buffer[len] = '\0';
    std::cout << buffer << std::endl;
    // snprintf(char *s,size_t,format...

#include <cstddef>
#include <cstring>
using namespace std;

class String
{
public:
    String(const char *str = NULL); // 普通构造函数
    String(const String &other);    // 复制构造函数
    ~String();
    String &operator=(const String &other); // 赋值函数重构"="
    String &...

#include <iostream>

class Box
{
public:
    // 构造函数
    Box(int h = 2, int w = 2, int len = 2);
    // 析构函数
    ~Box();
    int volume();

protected:
    int height, width, length;
};

Box::Box(int h, int w, int len)
{
    height = h;
    width = w;
    length = len;
}

Box::~Box()
{
    s...

#include <iostream>
#include <stdlib.h>

template <class T>

class Operation
{
private:
    T x, y;

public:
    Operation(T a, T b)
    {
        x = a;
        y = b;
    }
    T add();
    T sub();
};

template <class T>
T Operation<T>::add()
{
    return x + y;
}...

// 字符长度
int strLenght(char *s) {
  int n = 0;
  while (*s != '\0') {
    n++;
    s++;
  }
  return n;
}

// 复制字符串 s2->s1
char *strCopy(char *s1, char *s2) {
  char *p = s1;
  while (*s2 != '\0') {
    *p = *s2;
    s2++;
    p++;
  }
  *p = '\0';
  return s1;
}

// 拼接字...

#include <stdio.h>


int main(int argc,char* argv[]){
    printf("%d\n",argc);
    for(int i=0;i< argc;i++){
        printf("%s\n",argv[i]);
    }
    return 0;
}

#include <stdlib.h>
#include <stdio.h>

#define bool char
#define True 1
#define False 0

typedef int ElemType;

typedef struct node {
    ElemType data;
    struct node *next;
} Node;


Node *front, *rear;

void initQueue() {
    Node *p = malloc(sizeof(Node));
    p->next = NULL;...

#include <stdio.h>
#include <stdlib.h>

#define MaxSize 100
#define bool char
#define True 1
#define False 0

typedef int ElemType;

typedef struct SeqQueue {
    ElemType data[MaxSize];
    int front, rear; // 队头、队尾指针
} SQ;


void initSeqQueue(SQ *sq) {
    sq->front = 0;
    sq-&...

#include <stdio.h>
#include <stdlib.h>

#define MaxSize 10
#define bool char
#define True 1
#define False 0

typedef int ElemType;

// 顺序栈类型定义
typedef struct stack {
    ElemType data[MaxSize];
    int top;
} SeqStack;


void init(SeqStack *s) {
    s->top = -1;
};

bool is_empty(S...