huyuhang-c++-复习04

矩阵的转置

#include <iostream>
#define M 4
#define N 3
using namespace std;

int main (){

    int a[M][N]={{1, 3, 5}, {2, 4, 6}, {15, 7, 4}, {2, 8, 9}};
    int b[N][M];
    // a 的转置  行变列  列变行
    cout<<"调换前"<<endl;
    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            cout<<a[i][j]<<"\t";
        }
        cout<<endl;
    }
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            b[i][j] = a[j][i];
        }
    }
    cout<<"调换后"<<endl;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            cout<<b[i][j]<<"\t";
        }
        cout<<endl;
    }


    return 0;
}

递归

#include <iostream>
using namespace std;
int sum(int n){
    if (n <= 1)
        return 1;
    return sum(n-1) + n;

}
// sum(5)
// sum(4) + 5
// sum(3) + 4
// sum(2) + 3
// sum(1) = 1 + 2
int main (){
    // 递归函数: 函数内部自己调用自己的过程 recusion
    // 实现步骤: 1 将大问题转换为更小的一般性问题
    // 实现步骤: 2 需要有终止条件, 不能无限的递归下去
    int res1 = sum(5);
    int res2 = sum(100);
    cout<< "res1 = "<< res1 <<endl;
    cout<< "res2 = "<< res2 <<endl;
    return 0;
}

2

#include <iostream>
using namespace std;
// 1, 1, 2, 3, 5, 8, 13
// 求斐波那契数列的第n项和
int fibo(int n){
    if (n <= 2)
        return 1;
   return fibo(n-1) + fibo(n-2);
}
int main (){
    cout<< fibo(7) <<endl; // 13
    cout<< fibo(6) <<endl; // 8
    cout<< fibo(5) <<endl; // 5
    cout<< fibo(4) <<endl; // 3
    cout<< fibo(3) <<endl; // 2
    cout<< fibo(2) <<endl; // 1
    cout<< fibo(1) <<endl; // 1
    return 0;
}

3

#include <iostream>
using namespace std;
// 不用递归
int sum(int arr[],int len){
    int sum = 0;
    for (int i = 0; i < len; ++i) {
        sum += arr[i];
    }
    return sum;
}

// 递归
// 从左侧开始
int rsum(int arr[], int len, int l){
    // 要求数组的和, 只需要求 arr[0, len-1] 的和
    // ---> arr[0] + arr[1:len-1]
    // ---> arr[1] + arr[2:len-1]
//    if (l == len)
//        return 0;
    if (l == len -1)
        return arr[l];
    return arr[l] + rsum(arr, len, l+1);
}
// 从右侧开始
int rsum2(int arr[], int size){
    if (size == 1){
        return arr[size-1];
    }
    return arr[size-1] + rsum2(arr, size-1);
}
int main (){
    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    int len = sizeof(arr)/sizeof(arr[0]);
    cout<< rsum(arr, len, 0) <<endl;

    cout<< rsum2(arr, len) <<endl;
    return 0;
}

函数的重载 overload

什么是重载? 同名不同参
同名是函数名相同, 不同参是指 函数的参数类型和个数和顺序不相同, 这里与返回值没啥关系

#include <iostream>
using namespace std;
int add(int a, int b){
    return a + b;
}
double add(double a, int b){
    return a + b;
}
double add(int a, double b){
    return a + b;
}
double add(double a, double b){
    return a + b;
}
int add(int a, int b, int c){
    return a + b + c;
}
int main (){
    cout<< add(10, 20) <<endl;
    cout<< add(10.5, 20) <<endl;
    cout<< add(11, 20.5) <<endl;
    cout<< add(11, 20.5) <<endl;
    cout<< add(11.6, 20.5) <<endl;
    cout<< add(1, 2, 3) <<endl;
    return 0;
}

随机数组的生成

#include <iostream>
using namespace std;
void printArray(int array[], int len){
    cout<<"[";
    for (int i = 0; i < len; i++) {
        if (i == len-1)
            cout<< array[i] <<"]"<<endl;
        else
            cout<<array[i] << ", ";
    }
}
void generateArray(int arr[], int min, int max, int n){
    srand((unsigned)time(NULL));
    for (int i = 0; i < n; i++) {
        arr[i] = rand()%(max-min+1) + min;
    }
}
int main (){
    // [a, b]  50 100
//    srand((unsigned)time(NULL));
//    int a = rand()%(100-50+1) + 50;
//    cout<< a <<endl;
    int n = 10;
    int arr[n];
    generateArray(arr, 0, 100, 10);
    printArray(arr, n);

    return 0;
}