剑指Offer27 数组中超过一半的数

 /*************************************************************************
     > File Name: 27_MoreThanHalfNum.c
     > Author: Juntaran
     > Mail: JuntaranMail@gmail.com
     > Created Time: 2016年08月31日 星期三 16时40分55秒
  ************************************************************************/

 #include <stdio.h>

 int FindNum(int* nums, int length)
 {
     if (nums==NULL || length<=)
         return -;

     int ret = nums[];
     int count = ;
     for (int i = ; i < length; ++i)
     {
         if (nums[i] == ret)
             count ++;
         else
             count --;
         if (count == )
         {
             ret = nums[i];
             count = ;
         }
     }

     // 检验是否正确
     int count2 = ;
     for (int i = ; i < length; ++i)
     {
         if (nums[i] == ret)
             count2 ++;
     }
     if (count2* > length)
         return ret;
     else
         return -;
 }

 int main()
 {
     int nums[] = {,,,,,,,,};
     int length = ;
     int ret = FindNum(nums, length);
     if (ret == -)
         printf("Not Find\n");
     else
         printf("ret is %d\n", ret);

     return ;
 }