{"id":1199,"date":"2018-09-06T13:44:53","date_gmt":"2018-09-06T05:44:53","guid":{"rendered":"http:\/\/www.yusian.com\/blog\/?p=1199"},"modified":"2020-12-01T21:25:28","modified_gmt":"2020-12-01T13:25:28","slug":"c%e5%ad%a6%e4%b9%a0%e7%ac%94%e8%ae%b0","status":"publish","type":"post","link":"https:\/\/www.yusian.com\/blog\/cpp\/2018\/09\/06\/1344531199.html","title":{"rendered":"C++\u5b66\u4e60\u7b14\u8bb0"},"content":{"rendered":"

1\u3001C++\u7f16\u8bd1\u8fc7\u7a0b<\/strong>
\n1.1\u3001\u9884\u5904\u7406\uff0c\u7f16\u8bd1\u5668\u5c06C++\u4ee3\u7801\u4e2d\u7684\u5b8f\u3001\u5f15\u7528\u7b49\u9884\u5904\u7406\u6307\u5b9a\u8fdb\u884c\u5c55\u5f00\uff0c\u751f\u6210.i\u6216.ii\u6587\u4ef6\uff1b
\n1.2\u3001\u7f16\u8bd1\uff0c\u7f16\u8bd1\u5668\u5c06\u5c55\u5f00\u540e\u7684\u6587\u4ef6\u8fdb\u884c\u7f16\u8bd1\u751f\u6210\u6c47\u7f16\u6587\u4ef6.s\uff1b
\n1.3\u3001\u6c47\u7f16\uff0c\u6c47\u7f16\u5668\u5c06\u6c47\u7f16\u6587\u4ef6\u6c47\u7f16\u751f\u6210\u94fe\u63a5\u6587\u4ef6.o\u6216.obj\uff1b
\n1.4\u3001\u94fe\u63a5\uff0c\u94fe\u63a5\u5668\u5c06\u94fe\u63a5\u6587\u4ef6\u4e0e\u5e93\u6587\u4ef6\u6216\u7b2c\u4e09\u65b9\u6587\u4ef6\u94fe\u63a5\u751f\u6210\u4e8c\u8fdb\u5236\u6587\u4ef6\uff0c\u5373\u53ef\u6267\u884c\u6587\u4ef6\uff1b
\n1.5\u3001\u7b2c\u4e00\u4e2aC++\u7a0b\u5e8f<\/p>\n

#include \r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n    cout << \"Hello Cpp!!\" << endl;\r\n    return 0;\r\n}<\/pre>\n
2\u3001\u53d8\u91cf\u540d\u4e09\u6761\u5b9a\u5f8b<\/strong>
\n2.1\u3001\u53d8\u91cf\u540d\u53ea\u80fd\u662f\u4e0b\u5212\u7ebf\u3001\u5b57\u6bcd\u3001\u6570\u5b57\uff1b
\n2.2\u3001\u9996\u5b57\u6bcd\u53ea\u80fd\u662f\u4e0b\u5212\u7ebf\u3001\u5b57\u6bcd\uff1b
\n2.3\u3001\u4e0d\u80fd\u662f\u4fdd\u7559\u5b57\/\u5173\u952e\u5b57\uff1b<\/p>\n
3\u3001C++\u5e38\u7528\u6570\u636e\u7c7b\u578b<\/strong>
\n3.1\u3001int –> 32\u4f4d -2147483648\uff5e+2147483647\uff1b
\n3.2\u3001short int –> 16\u4f4d -32768\uff5e+32767\uff1b
\n3.3\u3001long int –> 32\u4f4d -2147483648\uff5e+2147483647\uff1b
\n3.4\u3001long long int –> 64\u4f4d -9223372036854775808 ~ +9223372036854775807\uff1b
\n3.5\u3001float 32\u4f4d –> -3.4E-38\uff5e+3.4E+38\uff1b
\n3.6\u3001double 64\u4f4d –> -1.7E-308\uff5e+1.7E+308\uff1b
\n3.7\u3001char 8\u4f4d –> -128\uff5e+127\uff1b
\n3.8\u3001\u5173\u4e8e\u7cbe\u5ea6\u7684\u4e00\u4e2a\u793a\u4f8b\uff1a<\/p>\n
#include \r\n#include \r\n\r\nusing namespace std;\r\n\r\nint main(){\r\n    int i = 1234567890;\r\n    float f = 1234567890123456789;\r\n    double d = 1234567890123456789;\r\n    long double ld = 1234567890123456789;\r\n    cout << setprecision(20);\r\n    cout << i << \"\\n\" << f << \"\\n\" << d << \"\\n\" << ld << endl;\r\n    return 0;\r\n}<\/pre>\n
1234567890
\n1234567939550609408
\n1234567890123456768
\n1234567890123456789
\nProgram ended with exit code: 0<\/code><\/p>\n
4\u3001\u7ecf\u5178\u5192\u6ce1\u6392\u5e8fC++\u5b9e\u73b0<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    \/\/ \u6570\u7ec4\u3001\u6570\u7ec4\u957f\u5ea6\u3001\u5faa\u73af\u6b21\u6570\r\n    int array[] = {128, 1, 11, 3, 33, 71, 2, 31, 4, 25, 61};\r\n    int len = sizeof(array) \/ sizeof(array[0]);\r\n    int loop_count = len - 1;\r\n    \/\/ \u5192\u6ce1\u6b21\u6570\u5faa\u73af\r\n    for (int i = 0; i < loop_count; i++){\r\n        \/\/ \u5355\u6b21\u5192\u6ce1\u6bd4\u8f83\u5faa\u73af\r\n        for (int j = 0; j < loop_count - i; j++){ if (array[j] > array[j+1]){\r\n                array[j] = array[j] + array[j+1];\r\n                array[j+1] = array[j] - array[j+1];\r\n                array[j] = array[j] - array[j+1];\r\n            }\r\n        }\r\n    }\r\n    for (int i = 0; i < len; i++){\r\n        cout << array[i] << endl;\r\n    }\r\n    return 0;\r\n}<\/pre>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    \/\/ \u6570\u7ec4\u3001\u6570\u7ec4\u957f\u5ea6\u3001\u5faa\u73af\u6b21\u6570(\u6700\u540e\u4e00\u4e2a\u6570\u4e0d\u9700\u8981\u6bd4\u8f83)\r\n    int array[] = {2, 1, 4, 3, 6, 5, 8, 7, 10, 9};\r\n    int len = sizeof(array) \/ sizeof(array[0]);\r\n    int loop_count = len - 1;\r\n    for (int i = 0; i < loop_count; i++){\r\n        \/\/ \u8c03\u6362\u524d\u5047\u8bbe\u5f53\u524d\u7b2c\u4e00\u4e2a\u4e3a\u6700\u5c0f\u6570\r\n        int min_index = i;\r\n        \/\/ \u4ece\u7b2c1\u4e2a\u5f00\u59cb\u5faa\u73af\uff0c\u53ef\u51cf\u5c11\u4e00\u6b21\u5faa\u73af\r\n        for (int j = i + 1; j < len; j++){\r\n            if (array[j] < array[min_index]){\r\n                min_index = j;\r\n            }\r\n        }\r\n        \/\/ \u5982\u679c\u7b2c\u4e00\u4e2a\u4e3a\u6700\u5c0f\u6570\uff0c\u4e0d\u4ea4\u6362\r\n        if (i != min_index){\r\n            array[i] = array[i] + array[min_index];\r\n            array[min_index] = array[i] - array[min_index];\r\n            array[i] = array[i] - array[min_index];\r\n        }\r\n    }\r\n    \/\/ \u91cd\u65b0\u6253\u5370\u6570\u7ec4\u4e2d\u7684\u503c(\u6392\u5e8f\u540e)\r\n    for (int i = 0; i < len; i++){\r\n        cout << array[i] << \" \";\r\n    }\r\n    return 0;\r\n}<\/pre>\n

\n5\u3001\u4e8c\u7ef4\u6570\u7ec4\u7684\u57fa\u672c\u4f7f\u7528<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    string students[] = {\"S1\", \"S2\", \"S3\"};\r\n    string courses[] = {\"\u8bed\u6587\", \"\u6570\u5b66\", \"\u82f1\u8bed\"};\r\n    const int s_len = 3;\r\n    const int c_len = 3;\r\n    int stu_cou[s_len][c_len];\r\n    for (int i = 0; i < s_len; i++){\r\n        for (int j = 0; j < c_len; j++){\r\n            cout << \"\u8bf7\u8f93\u5165\" << students[i] << \"\u7684\" << courses[j] << \"\u6210\u7ee9\uff1a\"; cin >> stu_cou[i][j];\r\n        }\r\n    }\r\n    for (int i = 0; i < c_len; i++){\r\n        cout << '\\t' << courses[i];\r\n    }\r\n    cout << endl;\r\n    for (int i = 0; i < s_len; i++){\r\n        cout << students[i];\r\n        for (int j = 0; j < c_len; j++){\r\n            cout << '\\t' << stu_cou[i][j];\r\n        }\r\n        cout << endl;\r\n    }\r\n    return 0;\r\n}<\/pre>\n
\u8f93\u51fa\u7ed3\u679c\uff1a
\n\u8bf7\u8f93\u5165S1\u7684\u8bed\u6587\u6210\u7ee9\uff1a11
\n\u8bf7\u8f93\u5165S1\u7684\u6570\u5b66\u6210\u7ee9\uff1a12
\n\u8bf7\u8f93\u5165S1\u7684\u82f1\u8bed\u6210\u7ee9\uff1a13
\n\u8bf7\u8f93\u5165S2\u7684\u8bed\u6587\u6210\u7ee9\uff1a21
\n\u8bf7\u8f93\u5165S2\u7684\u6570\u5b66\u6210\u7ee9\uff1a22
\n\u8bf7\u8f93\u5165S2\u7684\u82f1\u8bed\u6210\u7ee9\uff1a23
\n\u8bf7\u8f93\u5165S3\u7684\u8bed\u6587\u6210\u7ee9\uff1a31
\n\u8bf7\u8f93\u5165S3\u7684\u6570\u5b66\u6210\u7ee9\uff1a32
\n\u8bf7\u8f93\u5165S3\u7684\u82f1\u8bed\u6210\u7ee9\uff1a33
\n\u8bed\u6587    \u6570\u5b66    \u82f1\u8bed
\nS1      11      12      13
\nS2      21      22      23
\nS3      31      32      33<\/code><\/p>\n
Process returned 0 (0x0) execution time : 12.522 s
\nPress any key to continue.<\/p>\n
6\u3001\u6307\u9488\u7684\u4e24\u79cd\u89e3\u8bfb\u65b9\u5f0f<\/strong>
\n\/\/ \u4e00\u4e2a\u6307\u5411int\u503c\u7684\u6307\u9488ptr\uff0c\u91cd\u70b9\u5728\u6307\u5411\u503c\u4e3aint\u578b
\n1\u3001int *ptr = nullptr;
\n\/\/ \u4e00\u4e2aint\u7c7b\u578b\u7684\u6307\u9488ptr\uff0c\u91cd\u70b9\u5728\u8be5\u53d8\u91cf\u4e3a\u4e00\u4e2a\u6307\u9488
\n2\u3001int* ptr = nullptr;<\/p>\n
7\u3001\u5f15\u7528reference<\/strong>
\n\u5f15\u7528\u53ef\u4ee5\u7406\u89e3\u4e3a\u5bf9\u6307\u9488\u7684\u5c01\u88c5\uff0c\u6bd4\u6307\u9488\u539f\u59cb\u7684\u4f7f\u7528\u66f4\u52a0\u6548\u7387<\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    \/\/ \u6307\u9488\u6307\u5411\u53e6\u4e00\u4e2a\u53d8\u91cf\r\n    int num1 = 10;\r\n    int *ptr_num1 = &num1;\r\n    cout << num1 << '\\t' << *ptr_num1 << endl;\r\n\r\n    \/\/ \u5f15\u7528\u6307\u5411\u53e6\u4e00\u4e2a\u53d8\u91cf\r\n    int num2 = 10;\r\n    int &ref_num2 = num2;\r\n    cout << num2 << '\\t' << ref_num2 << endl;\r\n    return 0;\r\n}<\/pre>\n
8\u3001\u6570\u7ec4\u4e0e\u6307\u9488\u7684\u76f8\u4e92\u4f5c\u7528<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n    int arr[] = {1, 2, 3, 4, 5};\r\n    \/\/ ptr_arr\u4e3a\u6307\u5411\u6570\u7ec4\u7684\u6307\u9488\uff0c\u53ef\u4ee3\u66ff\u6570\u7ec4\u53d8\u91cf\u64cd\u4f5c\u6570\u7ec4\r\n    int *ptr_arr = arr;\r\n    ptr_arr[0] = 10;\r\n    cout << arr[0] << endl;\r\n    \/\/ \u6570\u7ec4\u53d8\u91cf\u4ee3\u8868\u7684\u662f\u6570\u7ec4\u672c\u8eab\uff0c\u4f46\u6307\u9488\u672c\u8d28\u53ea\u662f\u5730\u5740\r\n    cout << sizeof(arr) << '\\t' << sizeof(ptr_arr) << endl;\r\n    \/\/ \u6307\u9488\u7684\u57fa\u672c\u8fd0\u7b97\r\n    int *ptr = &arr[2];\r\n    ptr += 1;  \/\/ \u81ea\u589e\u6216\u81ea\u51cf\u6839\u636e\u7c7b\u578b\u5e73\u8861\r\n    cout << *ptr << endl;\r\n    return 0;\r\n}<\/pre>\n
\u8f93\u51fa\u7ed3\u679c\uff1a
\n10
\n20      4
\n4<\/code><\/p>\n
Process returned 0 (0x0) execution time : 0.035 s
\nPress any key to continue.<\/p>\n
9\u3001\u7a0b\u5e8f\u7684\u5185\u5b58\u5206\u914d<\/strong>
\n9.1\u3001\u6808\u533a(stack)
\n**\u7531\u7f16\u8bd1\u5668\u81ea\u52a8\u5206\u914d\u91ca\u653e\uff0c\u4e00\u822c\u5b58\u653e\u51fd\u6570\u7684\u53c2\u6570\u503c\u3001\u5c40\u90e8\u53d8\u91cf\u503c\u7b49\uff1b
\n**\u64cd\u4f5c\u65b9\u5f0f\u7c7b\u4f3c\u6570\u636e\u7ed3\u6784\u4e2d\u7684\u6808(\u5148\u8fdb\u540e\u51fa)
\n9.2\u3001\u5806\u533a(heap)
\n**\u4e00\u822c\u7531\u7a0b\u5e8f\u5458\u5206\u914d\u91ca\u653e\uff0c\u82e5\u7a0b\u5e8f\u5458\u4e0d\u91ca\u653e\uff0c\u7a0b\u5e8f\u7ed3\u675f\u65f6\u53ef\u80fd\u7531\u64cd\u4f5c\u7cfb\u7edf\u56de\u6536\uff1b
\n**\u6ce8\u610f\uff1a\u4e0e\u6570\u636e\u7ed3\u6784\u4e2d\u7684\u5806\u662f\u4e24\u56de\u4e8b\uff0c\u5206\u914d\u65b9\u5f0f\u7c7b\u4f3c\u94fe\u8868\uff1b
\n9.3\u3001\u5168\u5c40\u533a(\u9759\u6001\u533astaic)
\n**\u5168\u5c40\u53d8\u91cf\u548c\u9759\u6001\u53d8\u91cf\u662f\u5b58\u50a8\u5728\u4e00\u8d77\u7684
\n**\u7a0b\u5e8f\u7ed3\u675f\u540e\u7531\u7cfb\u7edf\u91ca\u653e
\n9.4\u3001\u6587\u5b57\u5e38\u91cf\u533a
\n**\u5e38\u91cf\u5b57\u7b26\u4e32\u5c31\u653e\u5728\u8fd9\u91cc\uff0c\u7a0b\u5e8f\u7ed3\u675f\u7531\u7cfb\u7edf\u91ca\u653e
\n9.5\u3001\u7a0b\u5e8f\u4ee3\u7801\u533a
\n**\u5b58\u653e\u51fd\u6570\u4f53\u7684\u4e8c\u8fdb\u5236\u4ee3\u7801<\/p>\n
10\u3001\u6570\u7ec4\u7684\u53c2\u6570\u4f20\u9012<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\n\/**\r\n \u6253\u5370\u4e00\u7ef4\u6570\u7ec4\r\n\r\n @param int \u6570\u7ec4\u540d\u79f0\r\n @param int \u6570\u7ec4\u957f\u5ea6\r\n *\/\r\nvoid show(int[], int);\r\n\r\n\/**\r\n \u4e8c\u7ef4\u6570\u7ec4\u7684\u6253\u5370(\u6ce8\u610f\uff1a\u7b2c\u4e8c\u4e2a\u7ef4\u5ea6\u7684\u6570\u7ec4\u957f\u5ea6\u5fc5\u987b\u6307\u5b9a\uff01\uff01)\r\n\r\n @param int \u6570\u7ec4\u540d\u79f0\r\n @param int \u6570\u7ec4\u957f\u5ea6\r\n *\/\r\nvoid show(int[][5], int);\r\n\r\n\/**\r\n \u7b49\u4ef7\u4e8evoid show(int[][5], int);\r\n\r\n @param int \u6570\u7ec4\u540d\u79f0\r\n @param int \u6570\u7ec4\u957f\u5ea6\r\n *\/\r\nvoid show(int(*)[5], int);\r\nint main(){\r\n    int array1[] = {1, 2, 3, 4, 5};\r\n    show(array1, 5);\r\n    int array2[][5] = {\r\n        {11, 12, 13, 14, 15},\r\n        {21, 22, 23, 24, 25},\r\n        {31, 32, 33, 34, 35}\r\n    };\r\n    show(array2, 3);\r\n    return 0;\r\n}\r\n\/**\r\n \u6253\u5370\u4e00\u7ef4\u6570\u7ec4\r\n \r\n @param array \u6570\u7ec4\u540d\u79f0\r\n @param length \u6570\u7ec4\u957f\u5ea6\r\n *\/\r\nvoid show(int array[], int length){\r\n    for (int i = 0; i < length; i++) {\r\n        cout << array[i] << '\\t';\r\n    }\r\n    cout << endl;\r\n}\r\n\r\n\/**\r\n \u4e8c\u7ef4\u6570\u7ec4\u7684\u6253\u5370(\u6ce8\u610f\uff1a\u7b2c\u4e8c\u4e2a\u7ef4\u5ea6\u7684\u6570\u7ec4\u957f\u5ea6\u5fc5\u987b\u6307\u5b9a\uff01\uff01)\r\n \r\n @param array \u6570\u7ec4\u540d\u79f0\r\n @param length \u6570\u7ec4\u957f\u5ea6\r\n *\/\r\nvoid show(int (*array)[5], int length){\r\n    for (int i = 0; i < length; i++) {\r\n        for (int j = 0; j < 5; j++) {\r\n            cout << array[i][j] << '\\t';\r\n        }\r\n        cout << endl;\r\n    }\r\n}<\/pre>\n
\u8f93\u51fa\u7ed3\u679c\uff1a
\n1\t2\t3\t4\t5
\n11\t12\t13\t14\t15
\n21\t22\t23\t24\t25
\n31\t32\t33\t34\t35
\nProgram ended with exit code: 0<\/code><\/p>\n
11\u3001\u51fd\u6570\u6307\u9488\u7684\u57fa\u672c\u7528\u6cd5<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint sum(int, int);\r\nint mut(int, int);\r\nint calc(int, int, int(*)(int, int));\r\nint main(){\r\n    \/\/ \u76f4\u63a5\u4f7f\u7528\u51fd\u6570\u540d\u505a\u4e3a\u53c2\u6570\r\n    cout << \"2 + 4 = \" << calc(2, 4, sum) << endl;\r\n    cout << \"2 * 4 = \" << calc(2, 4, mut) << endl;\r\n    \/\/ \u51fd\u6570\u6307\u9488\u7684\u58f0\u660e\u65b9\u5f0f\uff1aint(*ptr_name)(int, int)\r\n    int (*calc_ptr)(int, int);\r\n    \/\/ C++11\u53ca\u4ee5\u540e\u7684\u7248\u672c\u53ef\u4ee5\u4f7f\u7528auto ptr_name = function_name;\r\n    auto ptr_sum = sum;\r\n    int num1, num2;\r\n    char calc_char;\r\n    cout << \"\u8bf7\u8f93\u5165\u9700\u8981\u8ba1\u7b97\u7684\u4e24\u4e2a\u6570\u4e0e\u8ba1\u7b97\u7b26(\u5982\uff1a1 + 1)\uff1a\"; cin >> num1 >> calc_char >> num2;\r\n    switch (calc_char) {\r\n        case '+':\r\n            calc_ptr = sum;\r\n            break;\r\n        case '*':\r\n            calc_ptr = mut;\r\n            break;\r\n        default:\r\n            calc_ptr = NULL;\r\n            cout << \"\u62b1\u6b49\uff0c\u60a8\u8f93\u5165\u7684\u8ba1\u7b97\u7b26\u5f53\u524d\u6682\u4e0d\u652f\u6301\" << endl;\r\n            break;\r\n    }\r\n    if (calc_ptr != NULL){\r\n        int res = calc(num1, num2, calc_ptr);\r\n        cout << num1 << \" \" << calc_char << \" \" << num2 << \" = \" << res << endl;\r\n        int res_sum = calc(num1, num2, ptr_sum);\r\n        cout << num1 << \" + \" << num2 << \" = \" << res_sum << endl;\r\n    }\r\n    return 0;\r\n}\r\n\/** \u52a0\u6cd5\u8fd0\u7b97 *\/\r\nint sum(int a, int b){\r\n    return a + b;\r\n}\r\n\/** \u4e58\u6cd5\u8fd0\u7b97 *\/\r\nint mut(int a, int b){\r\n    return a * b;\r\n}\r\n\r\n\/**\r\n \u8ba1\u7b97\u65b9\u6cd5\r\n\r\n @param a \u7b2c\u4e00\u4e2a\u8fd0\u7b97\u6570\r\n @param b \u7b2c\u4e8c\u4e2a\u8fd0\u7b97\u6570\r\n @param func \u8fd0\u7b97\u65b9\u6cd5(\u52a0\u6cd5\u6216\u4e58\u6cd5)\r\n @return \u8fd0\u7b97\u7ed3\u679c\r\n *\/\r\nint calc(int a, int b, int (*func)(int, int)){\r\n    return func(a, b);\r\n}<\/pre>\n
\u8fd0\u884c\u7ed3\u679c\uff1a
\n2 + 4 = 6
\n2 * 4 = 8
\n\u8bf7\u8f93\u5165\u9700\u8981\u8ba1\u7b97\u7684\u4e24\u4e2a\u6570\u4e0e\u8ba1\u7b97\u7b26(\u5982\uff1a1 + 1)\uff1a4 * 9
\n4 + 9 = 13
\n4 * 9 = 36
\nProgram ended with exit code: 0<\/code><\/p>\n
12\u3001\u51fd\u6570\u53c2\u6570\u4f20\u9012\u7684\u5b9e\u8d28(\u57fa\u672c\u7c7b\u578b\u3001\u6307\u9488\u3001\u5f15\u7528)<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\nvoid swap1(int, int);\r\nvoid swap2(int *, int *);\r\nvoid swap3(int &, int &);\r\nint main(){\r\n    int num1 = 10, num2 = 20;\r\n    swap1(num1, num2);\r\n    cout << \"\u6267\u884cswap1\u540e\uff1a\" << num1 << '\\t' << num2 << endl;\r\n    swap2(&num1, &num2);\r\n    cout << \"\u6267\u884cswap2\u540e\uff1a\" << num1 << '\\t' << num2 << endl;\r\n    swap3(num1, num2);\r\n    cout << \"\u6267\u884cswap3\u540e\uff1a\" << num1 << '\\t' << num2 << endl;\r\n    return 0;\r\n}\r\n\/\/ \u53c2\u6570\u4f20\u9012\u7684\u662f\u526f\u672c\uff0c\u5bf9\u5f62\u53c2\u7684\u4fee\u6539\u4e0d\u5f71\u54cd\u539f\u503c\r\nvoid swap1(int num1, int num2){\r\n    int temp = num1;\r\n    num1 = num2;\r\n    num2 = temp;\r\n}\r\n\/\/ \u53c2\u6570\u4f20\u9012\u539f\u59cb\u6570\u636e\u7684\u6307\u9488\uff0c\u5bf9\u6307\u9488\u64cd\u4f5c\u76f4\u63a5\u4f5c\u7528\u539f\u503c\r\nvoid swap2(int *num1, int *num2){\r\n    int temp = *num1;\r\n    *num1 = *num2;\r\n    *num2 = temp;\r\n}\r\n\/\/ \u53c2\u6570\u4f20\u9012\u539f\u59cb\u6570\u636e\u7684\u5f15\u7528\uff0c\u5bf9\u5f62\u53c2\u7684\u64cd\u4f5c\u76f4\u63a5\u4f5c\u7528\u539f\u503c\uff0c\u5f15\u7528\u5b9e\u8d28\u4e0a\u662f\u6307\u9488\u7684\u5c01\u88c5\r\nvoid swap3(int &num1, int &num2){\r\n    int temp = num1;\r\n    num1 = num2;\r\n    num2 = temp;\r\n}<\/pre>\n
\u8fd0\u884c\u7ed3\u679c\uff1a
\n\u6267\u884cswap1\u540e\uff1a10\t20
\n\u6267\u884cswap2\u540e\uff1a20\t10
\n\u6267\u884cswap3\u540e\uff1a10\t20
\nProgram ended with exit code: 0<\/code><\/p>\n
13\u3001\u5982\u679c\u51fd\u6570\u8fd4\u56de\u503c\u4e3a\u5f15\u7528\u7c7b\u578b<\/strong><\/p>\n
#include \r\nusing namespace std;\r\n\/**\r\n \u8fd4\u56de\u7c7b\u578b\u4e3a\u5f15\u7528\u7684\u51fd\u6570\u5b9e\u73b0\r\n @param num \u5f15\u7528\u53c2\u6570\r\n @return \u8fd4\u56de\u5f15\u7528\u53c2\u6570\r\n *\/\r\nint &ref(int &num){\r\n    num++;\r\n    return num;\r\n}\r\nint main(){\r\n    int num = 2;\r\n    \/\/ \u8fd4\u56de\u7ed3\u679c\u8d4b\u503c\u7ed9result1\r\n    int result1 = ref(num);\r\n    \/\/ \u8fd4\u56de\u7ed3\u679c\u88abresult2\u5f15\u7528\r\n    int &result2 = ref(num);\r\n    \/\/ \u8fd4\u56de\u7ed3\u679c(\u5f15\u7528)\u88ab\u8d4b\u503c!!!\u5f15\u7528\u8fd4\u56de\u7ed3\u679c\u7684\u53d8\u91cf\u503c\u90fd\u4f1a\u88ab\u6539\u53d8\r\n    ref(num) = 10;\r\n    cout << result1 << '\\t' << result2 << endl;\r\n}<\/pre>\n
\u8fd0\u884c\u7ed3\u679c\uff1a
\n3\t10
\nProgram ended with exit code: 0<\/code><\/p>\n
14\u3001\u51fd\u6570\u91cd\u8f7d\u65f6\u5f15\u7528\u7684\u91cd\u8f7d<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nvoid func(int num){\r\n    cout << 1 << num << endl;\r\n}\r\nvoid func(int &num){\r\n    cout << 2 << num << endl;\r\n}\r\n\r\nint main(){\r\n    int num = 10;\r\n    func(num);\r\n    cout << \"Hello Cpp!!!\" << endl;\r\n    return 0;\r\n}<\/pre>\n
\u4ee5\u4e0a\u4ee3\u7801\u5728\u7f16\u8bd1\u65f6\u4f1a\u62a5\u9519\uff1aerror: call of overloaded ‘func(int&)’ is ambiguous|<\/em>
\n\u5982\u679c\u4e0d\u8c03\u7528\u4e0d\u4f1a\u62a5\u9519\uff0c\u80fd\u6b63\u5e38\u7f16\u8bd1\uff0c\u8c03\u7528\u65f6\u5219\u4e0d\u884c\uff0c\u539f\u56e0\u662f\u7f16\u8bd1\u5668\u65e0\u6cd5\u533a\u5206\u5230\u5e95\u8be5\u8c03\u7528\u54ea\u4e2a\u51fd\u6570\uff0c\u6240\u4ee5\u51fd\u6570\u5728\u91cd\u8f7d\u65f6\u4e0d\u80fd\u91cd\u8f7d\u201c\u5f15\u7528\u201d\u5c5e\u6027\uff1b<\/p>\n
15\u3001\u6a21\u677f\u51fd\u6570\u5b9e\u4f8b<\/strong><\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\n\/**\r\n \u6a21\u677f\u51fd\u6570\u5b9e\u73b0\u6392\u5e8f\r\n @param T \u6570\u7ec4\u7c7b\u578b\r\n @param int \u6570\u7ec4\u957f\u5ea6\r\n @return \u5b9e\u73b0\u6570\u636e\u5185\u90e8\u6392\u5e8f\uff0c\u65e0\u8fd4\u56de\u503c\r\n *\/\r\ntemplate  void Sort(T[],int);\r\n\/**\r\n \u6a21\u677f\u51fd\u6570\u5b9e\u73b0\u8f93\u51fa\r\n @param T \u6570\u7ec4\u7c7b\u578b\r\n @param int \u6570\u7ec4\u957f\u5ea6\r\n @return \u8f93\u51fa\u6570\u7ec4\u4e2d\u5143\u7d20\uff0c\u65e0\u8fd4\u56de\u503c\r\n *\/\r\ntemplate  void Show(T[],int);\r\nint main(){\r\n    int array1[] = {2, 1, 4, 3, 6, 5};\r\n    double array2[] = {2.2, 1.1, 4.4, 3.3, 6.6, 5.5};\r\n    Sort(array1, 5);\r\n    Sort(array2, 6);\r\n    Show(array1, 5);\r\n    Show(array2, 6);\r\n    return 0;\r\n}\r\n\r\ntemplate \r\nvoid Sort(T array[], int length) {\r\n    for (int i = 0; i < length-1; i++){\r\n        if (array[i] < array[i+1]) continue;\r\n        array[i] = array[i] + array[i+1];\r\n        array[i+1] = array[i] - array[i+1];\r\n        array[i] = array[i] - array[i+1];\r\n    }\r\n}\r\n\r\ntemplate \r\nvoid Show(T array[], int length) {\r\n    for (int i = 0; i < length; i++){\r\n        cout << array[i] << '\\t';\r\n    }\r\n    cout << endl;\r\n}<\/pre>\n
\u8fd0\u884c\u7ed3\u679c\uff1a
\n1\t2\t3\t4\t6
\n1.1\t2.2\t3.3\t4.4\t5.5\t6.6
\nProgram ended with exit code: 0<\/code><\/p>\n
16\u3001\u51fd\u6570\u4f7f\u7528\u603b\u7ed3\uff1a<\/strong><\/p>\n
1\u3001\u5185\u8054\u51fd\u6570\u4e3a\u4e86\u63d0\u9ad8\u8fd0\u884c\u6548\u7387\uff0c\u4e00\u822c\u4ee3\u7801\u8f83\u5c11\u903b\u8f91\u7b80\u5355\uff1b
\n2\u3001\u53c2\u6570\u7684\u5f15\u7528\u4f20\u9012\u80fd\u591f\u8282\u7701\u5185\u5728\u5f00\u9500\uff0c\u56e0\u4e3aC++\u4e2d\u53c2\u6570\u4f20\u9012\u9ed8\u8ba4\u4e3a\u526f\u672c\u62f7\u8d1d\uff1b
\n3\u3001\u51fd\u6570\u91cd\u8f7d\u80fd\u591f\u5728\u51fd\u6570\u540d\u76f8\u540c\u7684\u60c5\u51b5\u4e0b\u6839\u636e\u4e0d\u540c\u7684\u53c2\u6570\u5b9e\u73b0\u4e0d\u540c\u7684\u529f\u80fd\uff1b
\n4\u3001\u51fd\u6570\u6a21\u677f\u53ef\u4ee5\u4e00\u6b21\u6027\u5b9e\u73b0\u5404\u79cd\u7c7b\u578b\u53c2\u6570\u4e0b\u7684\u76f8\u540c\u4e1a\u52a1\uff1b
\n5\u3001\u9ed8\u8ba4\u53c2\u6570\u53ea\u80fd\u5728\u7533\u8bf7\u6216\u5b9e\u73b0\u65f6\u8d4b\u503c\uff0c\u4e0d\u80fd\u540c\u65f6\u8d4b\u503c\uff1b<\/p>\n","protected":false},"excerpt":{"rendered":"
1\u3001C++\u7f16\u8bd1\u8fc7\u7a0b 1.1\u3001\u9884\u5904\u7406\uff0c\u7f16\u8bd1\u5668\u5c06C++\u4ee3\u7801\u4e2d\u7684\u5b8f\u3001\u5f15\u7528\u7b49\u9884\u5904\u7406\u6307\u5b9a\u8fdb\u884c\u5c55\u5f00\uff0c\u751f\u6210.i\u6216.ii\u6587\u4ef6\uff1b 1.2\u3001\u7f16\u8bd1\uff0c\u7f16\u8bd1\u5668\u5c06\u5c55\u5f00\u540e\u7684\u6587\u4ef6\u8fdb\u884c\u7f16\u8bd1\u751f\u6210\u6c47\u7f16\u6587\u4ef6.s\uff1b 1.3\u3001\u6c47\u7f16\uff0c\u6c47\u7f16\u5668\u5c06\u6c47\u7f16\u6587\u4ef6\u6c47\u7f16\u751f\u6210\u94fe\u63a5\u6587\u4ef6.o\u6216.obj\uff1b 1.4\u3001\u94fe\u63a5\uff0c\u94fe\u63a5\u5668\u5c06\u94fe\u63a5\u6587\u4ef6\u4e0e\u5e93\u6587\u4ef6\u6216\u7b2c\u4e09\u65b9\u6587\u4ef6\u94fe\u63a5\u751f\u6210\u4e8c\u8fdb\u5236\u6587\u4ef6\uff0c\u5373\u53ef\u6267\u884c\u6587\u4ef6\uff1b 1.5\u3001\u7b2c\u4e00\u4e2aC++\u7a0b\u5e8f #include using namespace std; int main(){ cout << “Hello Cpp!!” << endl; return 0; } 2\u3001\u53d8\u91cf\u540d\u4e09\u6761\u5b9a\u5f8b 2.1\u3001\u53d8\u91cf\u540d\u53ea\u80fd\u662f\u4e0b\u5212\u7ebf\u3001\u5b57\u6bcd\u3001\u6570\u5b57\uff1b 2.2\u3001\u9996\u5b57\u6bcd\u53ea\u80fd\u662f\u4e0b\u5212\u7ebf\u3001\u5b57\u6bcd\uff1b 2.3\u3001\u4e0d\u80fd\u662f\u4fdd\u7559\u5b57\/\u5173\u952e\u5b57\uff1b 3\u3001C++\u5e38\u7528\u6570\u636e\u7c7b\u578b 3.1\u3001int –> 32\u4f4d -2147483648\uff5e+2147483647\uff1b 3.2\u3001short int –> 16\u4f4d -32768\uff5e+32767\uff1b 3.3\u3001long int –> 32\u4f4d -2147483648\uff5e+2147483647\uff1b 3.4\u3001long long int –> 64\u4f4d -9223372036854775808 ~ +9223372036854775807\uff1b 3.5\u3001float 32\u4f4d –> -3.4E-38\uff5e+3.4E+38\uff1b 3.6\u3001double 64\u4f4d –> […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[88],"tags":[93,89,92,91],"class_list":["post-1199","post","type-post","status-publish","format-standard","hentry","category-cpp","tag-c-c","tag-c","tag-cpp","tag-91"],"_links":{"self":[{"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/posts\/1199","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/comments?post=1199"}],"version-history":[{"count":0,"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/posts\/1199\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/media?parent=1199"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/categories?post=1199"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.yusian.com\/blog\/wp-json\/wp\/v2\/tags?post=1199"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}