LeetCode第一天

一、阶乘之和

#include <iostream>
using namespace std;

void f1(int n) {
    long long int sum = 0;
    for (int i = 1; i <= n; i++) {
        long long int flag = 1;
        for (int m = 1; m <= i; m++)
            flag *= m;
        sum += flag;
    }
    cout << "f1:" << sum << endl;
}

void f2(int n) {
    long long int sum = 0;
    long long int flag = 1;
    for (int i = 1; i <= n; i++) {
        flag *= i;
        sum += flag;
    }
    cout << "f2:" << sum << endl;
}

int main()
{
    int n;
    cin >> n;
    f1(n); f2(n);
}

二、选择排序

#include <iostream>
using namespace std;

void print(int* arr, int len) {
    for (int i = 0; i < len; i++)
        cout << arr[i] << " ";
    cout << endl;
}

void swap(int* arr, int i, int j) {
    int tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
}

void selectionSort(int *arr,int len) {
    for (int i = 0; i < len; i++) {
        int minIndex = i;
        for (int m = i; m < len; m++)
            minIndex = arr[minIndex] > arr[m] ? m : minIndex;
        swap(arr, i, minIndex);
    }
}

int main(){
    int arr[10] = { 9,2,3,1,5,56,31,12,321,33 };
    int len = sizeof(arr) / sizeof(arr[0]);
    print(arr, len);
    selectionSort(arr, len);
    print(arr, len);
}

三、冒泡排序

#include <iostream>
using namespace std;

void print(int* arr, int len) {
    for (int i = 0; i < len; i++)
        cout << arr[i] << " ";
    cout << endl;
}

void swap(int* arr, int i, int j) {
    int tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
}

void bubbleSort(int* arr, int len) {
    for (int i = 0; i < len; i++) {
        for (int m = i + 1; m < len; m++)
            if (arr[i] < arr[m])
                swap(arr, i, m);
    }
}

int main() {
    int arr[10] = { 9,2,3,1,5,56,31,12,321,33 };
    int len = sizeof(arr) / sizeof(arr[0]);
    print(arr, len);
    bubbleSort(arr, len);
    print(arr, len);
}

四、插入排序

#include <iostream>
using namespace std;

void print(int* arr, int len) {
    for (int i = 0; i < len; i++)
        cout << arr[i] << " ";
    cout << endl;
}

void swap(int* arr, int i, int j) {
    int tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
}

void insertSort(int* arr, int len) {
    for (int i = 1; i < len; i++) {
        int currentNum = i;
        while (currentNum - 1 >= 0 && arr[currentNum - 1] > arr[currentNum]) {
            swap(arr, currentNum, currentNum - 1);
            currentNum--;
        }
    }
}

int main() {
    int arr[10] = { 9,2,3,1,5,56,31,12,321,33 };
    int len = sizeof(arr) / sizeof(arr[0]);
    print(arr, len);
    insertSort(arr, len);
    print(arr, len);
}​

五、random随机函数的学习

转化为概率问题，将1-5的随机改为0-1的随机或1-7的随机、将01不等概率转化为01等概率事件

转化为0到1的方法：1、2为0，4、5为1，3重新生成，从而得到0-1的随机

转化为1-7的方法：用二进制来实现，转化为000-111的随机，而每一个0和1的生成用0-1随机生成来得出

01不等概率转化为01等概率事件的方法：还是利用二进制来实现，00重做，11重做，01为1，10为0