C++Primer6.2.9练习题。

来源：互联网发布：股票分析算法方法编辑：程序博客网时间：2024/06/02 02:32

#include <iostream>#include <vector>#include <string>#include <string.h>#include <cstringt.h>#include <cctype>#include <algorithm>using namespace std;void print_R(int (&arr)[10]){ for (auto elem : arr) {  cout << elem << endl; }}void print_P(int (*arr)[10]){ for (int i = 0; i < 10; i++) {  cout << (*arr)[i] << endl; }}int max_ont(int a, int *b){ if (a > *b) {  return a; } else {  return *b; }}void switchPV(int &a, int &b){ int temp; temp =*(&a); a = b; b = temp;}void print_C(const int ia[10]){ for (size_t i = 0; i != 10; ++i) {  cout << ia[i] << endl; }}void error_msg(initializer_list<string> i){ for (const auto elem : i) {  cout << &elem << endl; }}int main(){ int digital = 0; switch (digital) { case 1: case 3: case 5: case 6: case 8:  break; } int array[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; //print_R(array); //int array_1[10]; //print_R(array_1); //int(*array_2)[10] = &array; //print_P(array_2); //int a = 100; //int temp = 1000; //int *b = &temp; //cout<<max_ont(a, b); //int *num1 = &array[0]; //int *num2 = &array[1]; //switchPV((*num1), (*num2)); //cout << *num1; //cout << *num2; //print_C(array); error_msg({"msg send", "success."}); system("pause"); return 0;}

0 0