快排&归并&堆排C++版本

void quickSort(vector<int> &inputs,int left ,int right){
    if(left>=right) return;
    int pivot = inputs[right];
    int i=left;
    for(int j=left;j<right;j++){
        if(inputs[j]<pivot)
            swap(inputs[i++],inputs[j]);
    }
    swap(inputs[i],inputs[right]);
    quickSort(inputs,left,i-1);
    quickSort(inputs,i+1,right);
}

个人公众号,欢迎关注

YouChouNoBB

void merge(vector<int> &data,int left,int mid,int right){
        vector<int> tmp(right-left+1);
        int i=left ,j=mid+1,k=0;
        while(i<=mid && j<=right){
            if(data[i]>data[j])
                tmp[k++]=data[j++];
            else
                tmp[k++]=data[i++];
        }
        while(i<=mid)
            tmp[k++]=data[i++];
        while(j<=right)
            tmp[k++]=data[j++];
        for(int t=0;t<tmp.size();t++){
            data[left+t]=tmp[t];
        }
    }

void mergeSort(vector<int> &data ,int left,int right){
        if(left>=right) return;
        int mid = (left+right)/2;
        mergeSort(data,left,mid);
        mergeSort(data,mid+1,right);
        merge(data,left,mid,right);
}

void adjustHeap(vector<int> &data,int i,int length){
        int left=2*i+1; //左子树
        int right=2*i+2; //右子树
        int largest=i; //定义最大值下标，最后调整最大值

        if(left<length && data[i]<data[left]) //左子树更大
            largest=left;

        if(right<length && data[largest]<data[right]) //右子树更大
            largest=right;

        if(largest!=i){ //如果来自左右子树的更大，那就交换，并继续调整
            swap(data[largest],data[i]);
            adjustHeap(data,largest,length);
        }
    }

    void heapSort(vector<int> &data){
        for(int i=data.size()/2-1;i>=0;--i){ //构建大顶堆,从第一个非叶子节点开始，从右往左
            adjustHeap(data,i,data.size());
        }

        for(int i=data.size()-1;i>0;--i){ //调整堆结构，交换首尾元素
            swap(data[i],data[0]); //将堆顶元素放到末尾
            adjustHeap(data,0,i);   //重新对堆调整
        }
    }

一个变种归并排序题目,合并K个有序数组,思路还是一样的,稍微改改就行

#include <iostream>
using namespace std;
#include <vector>

vector<int> merge(vector<int> a,vector<int> b){
    vector<int> res(a.size()+b.size());
    int i=0,j=0,k=0;
    while (i<a.size() && j<b.size()) {
        if(a[i]<b[j]){
            res[k++]=a[i++];
        }else{
            res[k++]=b[j++];
        }
    }
    while(i<a.size()){
        res[k++]=a[i++];
    }
    while(j<b.size()){
        res[k++]=b[j++];
    }
    return res;
}

vector<int> mergeSort(vector<vector<int>> data,int left,int right){
    if(left>=right) return data[left];
    int mid = (left+right)/2;
    vector<int> left_res=mergeSort(data,left,mid);
    vector<int> right_res=mergeSort(data,mid+1,right);
    return merge(left_res,right_res);
}

vector<int> solution(vector<vector<int>> data){
    return mergeSort(data,0,data.size()-1);
}

int main() {
    // char str[3];
    // std::cin>>str;
    vector<vector<int>> data ={{1,3,5},{2,4,5},{7,8,9}};
    // vector<int> a={1,3,5};
    // vector<int> b={2,4,5};
    // vector<int> m=merge(a,b);
    vector<int> res = solution(data);
    for(int i:res){
        cout<<i<<",";
    }
    std::cout << "hello world" << std::endl;
    return 0;
}

个人公众号,欢迎关注 : YouChouNoBB