洗牌算法Knuth-shuffle

原理可查看下面的文章

https://mp.weixin.qq.com/s?__biz=MzU4NTIxODYwMQ==&mid=2247484310&idx=1&sn=916f92afff6016256648cfb3c7fd83e7&chksm=fd8cacd0cafb25c670587f22524b111d74b4ddd9954070930b6ef6efb1bd8fba13d4250e57d8&token=885428195&lang=zh_CN#rd

代码：

void shuffle(vector<int> cards)
{
    int n = cards.size();
    if(n == 0)
        return;
    srand(time(0));
    //从后往前遍历
    for(int i = n - 1; i >= 0; i--)
        swap(cards[i], cards[rand()%(i+1)]);
    /*从前往后遍历
    for(int i = 0; i < n; i++)
        swap(cards[i], cards[i + rand()%(n-i)]
    */
}