剑指offer 编程题（44）：扑克牌顺子

0代表任意数，判断数组是否为顺子。

class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        if(numbers.size() <= 0)
        {
            return false;
        }
        int arr[14] ={0};
        int min = 13,max = 0;
        for(int i = 0;i < numbers.size();i++)
        {
            arr[numbers[i]]++;
        }
        for(int i = 0;i < numbers.size();i++)
        {
           if(numbers[i] == 0)
           {
               continue;
           }
            if(arr[numbers[i]] > 1)
            {
                return false;
            }
            if(numbers[i] > max)
            {
                max = numbers[i];
            }
            if(numbers[i] < min )
            {
                min = numbers[i];
            }
        }
        if((max - min) < 5)
        {
            return true;
        }
        else{
            return false;
        }
    }
};

class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        if(numbers.size() <= 0)
        {
            return false;
        }
        int arr[14] ={0};
        int min = 13,max = 0;
        sort(numbers.begin(),numbers.end());
        for(int i = 0;i < numbers.size();i++)
        {
            if(numbers[i] == 0)
            {
                continue;
            }
            if( numbers[i] == numbers[i+1])
            {
                return false;
            }
             if(numbers[i] > max)
            {
                max = numbers[i];
            }
            if(numbers[i] < min)
            {
                min = numbers[i];
            }
        }
        if((max - min) < 5)
        {
            return true;
        }
        else{
            return false;
        }
    }
};