简单的麻将胡牌算法

          今天尝试写了一个简单麻将的胡牌算法,规则很简单,看代码:

#include<stdio.h>
#include<string.h>

/*1,2,3,4,5,6,7,8,9            万
  11,12,13,14,15,16,17,18,19   索
  21,22,23,24,25,26,27,28,29   饼
*/

//胡牌规则:要一对将,其他的是顺子或是叉牌,这是比较简单的胡牌规则

int check_shunzi(int a,int b,int c)
{
	//printf("shunzi= %d,%d,%d\n",a,b,c);
    if(a - b == 1)
    {
	   if(b - c == 1)
		   return 1;
	}
	else if (b - a == 1)
	{
	   if (c - b == 1)
		   return 1;
	}
	else
	{
	    return 0;
	}

	return 0;
}

int check_chapai(int a,int b,int c)
{
	//printf("chapai= %d,%d,%d\n",a,b,c);
    if(a == b)
		if((b == c))
		   return 1;
	else
	    return 0;
}

int main()
{
   //麻将摸到首先要进行排序,假设下面是排序后的结果,排序后同,万,饼分别在一起
	int pooker[] = {3,3,4,4,4,11,12,13,14,14,14,22,22,22};

   int dui_count = 0;
   
   int i = 0;
   for(i = 0;i < 12;i++)
   {
      if(pooker[i] == pooker[i + 1])
	  {
		  if(check_chapai(pooker[i],pooker[i + 1],pooker[i + 2]))
		  {
		      i += 2;
		  }
		  else
		  {
		      i += 1;
              dui_count++;
		  }
	  }
	  else if(check_shunzi(pooker[i],pooker[i + 1],pooker[i + 2]))
	  {
		  i += 2;
	  }
	  else
	  {
          printf("不能胡牌\n");
		  return 0;
	  }
   }

   if(dui_count == 1)
   {
     printf("可以胡牌\n");
   }
   else
   {
      printf("不能胡牌\n");
   }

   return 0;
}

也就是根据相应的麻将规则去写逻辑。

猜你喜欢

转载自blog.csdn.net/ma2595162349/article/details/79826347