扑克牌顺子

 1 class Solution {
 2 public:
 3     bool IsContinuous( vector<int> numbers ) {
 4         if(numbers.size()==0) return false;
 5         sort(numbers.begin(),numbers.end());
 6         int count=0;
 7         for(int i=0;i<4;i++){
 8             if(numbers[i]==0) count++;
 9             else break;
10         }
11         int pre=numbers[count];
12         for(int j=count+1;j<numbers.size();j++){
13             int cha = numbers[j]-pre;
14             if(cha==0) return false;
15             else if(cha>1) count-=cha-1;
16             if(count<0) return false;
17             pre=numbers[j];
18         }
19         return true;
20     }
21 };