cpp代码调试，调试扑克牌的代码

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

 
class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        int length = numbers.size();
        if(length <= 0)
            return false;
        //sort(numbers,numbers+length);
        sort(numbers.begin(),numbers.end());
        int count = 0;
        for(int i = 0;i < length;i++){
            if(numbers[i] == 0)
                count++;
        }
        int diff = 0;
        for(int i = count;i < length - 1;i++){
            diff = numbers[i+1] - numbers[i] - 1;
            cout << numbers[i+1] << " "<< numbers[i] << " " << diff << endl;
        }
        // cout << diff << endl;
        // cout << count << endl;
        return diff <= count ? true : false;
    }
};


int main()
{
   int array[5] = {0,3,1,6,4};
   vector<int> iv(array, array+5);
   Solution a;
   cout << a.IsContinuous(iv) << endl;

   return 0;
}

１．使用vector要ｉｎｃｌｕｄｅ<vector>

2.学会用数组去初始化ｖｅｃｔｏｒ，数组使用的是{ }不是[ ]

3.sort函数要include<algorithm>