Unity 网络斗地主 判断牌的类型
Unity 网络斗地主 牌的类型
web版本演示地址: http://www.dreamhome666.com/Desktop.html
在上个版本中,下面的角色在牌的后面,可以将角色做为一个Panel的子物体,然后调整Panel的depth,即可调整顺序!
进入正题,定义牌的类型!
用c#的enum来实现枚举判断,斗地主的牌的类型有,
/// <summary>
/// 牌类型
/// </summary>
public enum cardtype
{
//未知类型
none,
//王炸
wangzha,
//炸弹
zhadan,
//四张带两张
sidaier,
//三个不带
sangebudai,
//三个带一
sandaiyi,
//三个带二
sandaier,
//两个三个
lianggesange,
//两个三个带二个
lianggesangedaier,
//两个三个带四个
lianggesangedaisige,
//三个三个
sangesange,
//三个三个带三个
sangesangedaisange,
//三个三个带六个
sangesangedailiuge,
//四个三个
sigesange,
//四个三个带四个
sigesangedaisange,
//四个三个带八个
sigesangedailiuge,
//五个三个
wugesange,
//五个三个带五个
wugesangedaiwuge,
//六个三个
liugesange,
//顺子
danshun,
//双顺
shangshun,
//对子
duizi,
//单个
dan
}
判断牌的类型及大小!
using UnityEngine;
using System.Collections;
using System.Collections.Generic;
/*
* 判断牌的类型
*/
public class CardPop : MonoBehaviour
{
/// <summary>
/// 判断是否包含大小王
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool ishavewang(int[] data)
{
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
return true;
}
}
return false;
}
/// <summary>
/// 是否带2
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool isdai2(int[] data)
{
for (int i = 0; i < data.Length; i++)
{
if (data[i]%13==1)
{
return true;
}
}
return false;
}
/// <summary>
/// 判断对子 53和52是大王和小王
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool isduizi(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
int temp1 = data[0] % 13;
int temp2 = data[1] % 13;
if (temp1 == temp2)
{
max = temp1;
if (temp1 == 0)
{
max = 13;
}
if (temp1 == 1)
{
max = 14;
}
return true;
}
return false;
}
/// <summary>
/// 双顺
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool isshuangshun(int[] data,out int max)
{
max = -1;
if (ishavewang(data)||isdai2(data))
{
return false;
}
for (int i = 0; i < data.Length; i += 2)
{
if (i == data.Length - 2)
{
int temp1 = data[i] % 13;
int temp2 = data[i + 1] % 13;
if (temp1 != temp2)
{
return false;
}
}
else
{
int temp1 = data[i] % 13;
int temp2 = data[i + 1] % 13;
if (temp1 == 0)
{
temp1 = 13;
}
if (temp2 == 0)
{
temp2 = 13;
}
int temp3 = data[i + 2] % 13;
if (temp1 != temp2 || temp2 - temp3 != 1)
{
return false;
}
}
}
max = data[0] % 13;
return true;
}
/// <summary>
/// 单顺
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool isdanshun(int[] data,out int max)
{
max = -1;
if (ishavewang(data)||isdai2(data))
{
return false;
}
for (int i = 0; i < data.Length-1; i++)
{
int temp1 = data[i] % 13;
int temp2 = data[i+1] % 13;
if (temp1 == 0)
{
temp1 = 13;
}
if (temp2 == 0)
{
temp2 = 13;
}
if (temp1 - temp2 != 1)
{
return false;
}
}
max = data[0] % 13;
return true;
}
/// <summary>
/// 六个三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool isliugesange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 6)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 五个三个带五个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool iswugesangedaiwuge(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if(data[i]==52||data[i]==53)
{
continue;
}
int data2 = data[i]%13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 5)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 五个三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool iswugesange(int[] data,out int max)
{
max = -1;
if(ishavewang(data))
{
return false;
}
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 5)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 四个三个带八个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issigesangedailiuge(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
List<int> datat = new List<int>();
int count2 = 0;
for (int i = 0; i < data.Length; i++)
{
int temp1 = data[i] % 13;
if (data1.Contains(temp1)||datat.Contains(temp1))
{
continue;
}
int count22=0;
for (int j = 0; j < data.Length; j++)
{
int temp2 = data[j] % 13;
if (temp1 == temp2)
{
count22++;
}
}
if (count22 == 2)
{
count2++;
datat.Add(temp1);
}
}
if (count1==4&&count2 == 4)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 四个三个带四个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issigesangedaisige(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 4)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 四个三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issigesange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 4)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 三个三个带六个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issangesangedailiuge(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
List<int> datat = new List<int>();
int count2 = 0;
for (int i = 0; i < data.Length; i++)
{
int temp1 = data[i] % 13;
if (data1.Contains(temp1) || datat.Contains(temp1))
{
continue;
}
int count22 = 0;
for (int j = 0; j < data.Length; j++)
{
int temp2 = data[j] % 13;
if (temp1 == temp2)
{
count22++;
}
}
if (count22 == 2)
{
count2++;
datat.Add(temp1);
}
}
if (count1 == 3 && count2 == 3)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 三个三个带三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issangesangedaisange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 3)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 三个三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issangesange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 3)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 两个三个带四个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool islianggesangedaisige(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
List<int> datat = new List<int>();
int count2 = 0;
for (int i = 0; i < data.Length; i++)
{
int temp1 = data[i] % 13;
if (data1.Contains(temp1) || datat.Contains(temp1))
{
continue;
}
int count22 = 0;
for (int j = 0; j < data.Length; j++)
{
int temp2 = data[j] % 13;
if (temp1 == temp2)
{
count22++;
}
}
if (count22 == 2)
{
count2++;
datat.Add(temp1);
}
}
if (count1 == 2 && count2 == 2)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 两个三个带两个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool islianggesangedailiangge(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 2)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 两个三个
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool islianggesange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 2)
{
for (int i = 0; i < data1.Count; i++)
{
if (i != data1.Count - 1)
{
int m1 = data1[i];
int m2 = data1[i + 1];
if (m1 == 0)
{
m1 = 13;
}
if (m2 == 0)
{
m2 = 13;
}
if (m1 - m2 != 1)
{
return false;
}
}
}
max = data1[0];
return true;
}
return false;
}
/// <summary>
/// 三带二
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issandaier(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
List<int> datat = new List<int>();
int count2 = 0;
for (int i = 0; i < data.Length; i++)
{
int temp1 = data[i] % 13;
if (data1.Contains(temp1) || datat.Contains(temp1))
{
continue;
}
int count22 = 0;
for (int j = 0; j < data.Length; j++)
{
int temp2 = data[j] % 13;
if (temp1 == temp2)
{
count22++;
}
}
if (count22 == 2)
{
count2++;
datat.Add(temp1);
}
}
if (count1 == 1 && count2 == 1)
{
max = data1[0];
if (data1[0] == 0)
{
max = 13;
}
if (data1[0] == 1)
{
max = 14;
}
return true;
}
return false;
}
/// <summary>
/// 三带一
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issandaiyi(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 1)
{
max = data[0];
if (data1[0] == 0)
{
max = 13;
}
if (data1[0] == 1)
{
max = 14;
}
return true;
}
return false;
}
/// <summary>
/// 三个不带
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issange(int[] data,out int max)
{
max = -1;
List<int> data1 = new List<int>();
int count1 = 0;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data2 = data[i] % 13;
if (data1.Contains(data2))
{
continue;
}
int count = 0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data3 = data[j] % 13;
if (data2 == data3)
{
count++;
}
}
if (count == 3)
{
data1.Add(data2);
count1++;
}
}
if (count1 == 1)
{
max = data1[0];
if (data1[0] == 0)
{
max = 13;
}
if (data1[0] == 1)
{
max = 14;
}
return true;
}
return false;
}
/// <summary>
/// 四带二
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool issidaier(int[] data,out int max)
{
max = -1;
for (int i = 0; i < data.Length; i++)
{
if (data[i] == 52 || data[i] == 53)
{
continue;
}
int data1 = data[i] % 13;
int count1=0;
for (int j = 0; j < data.Length; j++)
{
if (data[j] == 52 || data[j] == 53)
{
continue;
}
int data2 = data[j] % 13;
if (data1 == data2)
{
count1++;
}
}
if (count1 == 4)
{
max = data1;
if (data1 == 0)
{
max = 13;
}
if (data1 == 1)
{
max = 14;
}
return true;
}
}
return false;
}
/// <summary>
/// 炸弹
/// </summary>
/// <param name="data"></param>
/// <returns></returns>
public bool iszhadan(int[] data,out int max)
{
max = -1;
if (ishavewang(data))
{
return false;
}
int data1 = data[0] % 13;
int data2 = data[1] % 13;
int data3 = data[2] % 13;
int data4 = data[3] % 13;
if (data1 == data2 && data1 == data3 && data1 == data4)
{
max = data1;
if (data1 == 0)
{
max = 13;
}
if (data1 == 1)
{
max = 14;
}
return true;
}
return false;
}
public bool iswangzha(int[] data,out int max)
{
max = 16;
if (data[0] == 53 && data[1] == 52)
{
return true;
}
else
{
return false;
}
}
public bool isok(int[] data,out int max)
{
max = -1;
int temp=-1;
switch (data.Length)
{
case 1:
if (data[0]%13 == 0)
{
max = 13;
}
if (data[0]%13 == 1)
{
max = 14;
}
if (data[0] == 52)
{
max = 15;
}
if (data[0] == 53)
{
max = 16;
}
max = data[0] % 13;
return true;
break;
case 2:
if (isduizi(data,out temp)||iswangzha(data,out temp))
{
max = temp;
return true;
}
break;
case 3:
if (issange(data,out temp))
{
max = temp;
return true;
}
break;
case 4:
if (issandaiyi(data,out temp)||iszhadan(data,out temp))
{
max = temp;
return true;
}
break;
case 5:
if (issandaier(data,out temp) || isdanshun(data,out temp))
{
max = temp;
return true;
}
break;
case 6:
if (isdanshun(data,out temp) || isshuangshun(data,out temp) || islianggesange(data,out temp) || issidaier(data,out temp))
{
max = temp;
return true;
}
break;
case 7:
if (isdanshun(data,out temp))
{
max = temp;
return true;
}
break;
case 8:
if (isdanshun(data, out temp) || isshuangshun(data, out temp) || islianggesangedailiangge(data, out temp))
{
max = temp;
return true;
}
break;
case 9:
if (isdanshun(data, out temp) || issangesange(data, out temp))
{
max = temp;
return true;
}
break;
case 10:
if (isdanshun(data, out temp) || isshuangshun(data, out temp))
{
max = temp;
return true;
}
break;
case 11:
if (isdanshun(data, out temp))
{
max = temp;
return true;
}
break;
case 12:
if (isdanshun(data, out temp) || isshuangshun(data, out temp) || issigesange(data, out temp) || issangesangedaisange(data, out temp))
{
max = temp;
return true;
}
break;
case 13:
if (isdanshun(data, out temp))
{
max = temp;
return true;
}
break;
case 14:
if (isdanshun(data, out temp) || isshuangshun(data, out temp))
{
max = temp;
return true;
}
break;
case 15:
if (isdanshun(data, out temp) || iswugesange(data, out temp))
{
max = temp;
return true;
}
break;
case 16:
if (isshuangshun(data, out temp) || issigesangedaisige(data, out temp))
{
max = temp;
return true;
}
break;
case 18:
if (isshuangshun(data, out temp) || isliugesange(data, out temp))
{
max = temp;
return true;
}
break;
case 20:
if (isshuangshun(data, out temp))
{
max = temp;
return true;
}
break;
default:
return false;
}
return false;
}
}
Unity 网络斗地主 判断牌的类型的更多相关文章
- Unity 网络斗地主 牌的一些算法
Unity 网络斗地主 牌的一些算法 在这儿说一下,我的项目是用svn的方式,上传在https://v2.svnspot.com/18666451713.doudizhu这个svn上,大家可以下载T ...
- Unity网络斗地主 服务端
Unity网络斗地主 服务端 @by梦想之家2工作室 阿龙 已经做好了服务器框架,并且能实现服务器给客户端分牌的问题!
- Unity NGUI 网络斗地主 -发牌 脚本交互
Unity NGUI 网络斗地主 -发牌 脚本交互 @By 灰太龙 Unity4.2.1f4 NGUI 3.0.4 本篇说的问题是脚本与控件的交互! 现在对界面进行了改进,先看副图! 1.制作发牌效果 ...
- Unity NGUI 网络斗地主 -制作图集 Atlas
Unity NGUI 网络斗地主 -制作图集 Atlas by @杨海龙 开发环境 Win7+Unity4.2.1f4+NGUI 3.0.4版本 这一节告诉大家如何制作(图集)Atlas! 1.首 ...
- Unity NGUI 网络斗地主 -界面制作
Unity NGUI 网络斗地主 -界面制作 源文件在群(63438968群共享!) @灰太龙 这一节说一下NGUI的界面摆放,并且教会大家使用NGUI的自适应功能! 在这里感谢@Gamer,是他给我 ...
- iOS中利用CoreTelephony获取用户当前网络状态(判断2G,3G,4G)
前言: 在项目开发当中,往往需要利用网络.而用户的网络环境也需要我们开发者去注意,根据不同的网络状态作相应的优化,以提升用户体验. 但通常我们只会判断用户是在WIFI还是移动数据,而实际上,移动数据也 ...
- Android 网络连接判断与处理
Android网络连接判断与处理 获取网络信息需要在AndroidManifest.xml文件中加入相应的权限. <uses-permission android:name="and ...
- Map集合、HashMap集合、LinkedHashMap集合、Hashtable集合、Collections工具类和模拟斗地主洗牌和发牌
1.Map集合概述和特点 * A:Map接口概述 * 查看API可以知道: * 将键映射到值的对象 * 一个映射不能包含重复的键 * 每个键最多 ...
- 利用CoreTelephony获取用户当前网络状态(判断2G,3G,4G)
前言: 在项目开发当中,往往需要利用网络.而用户的网络环境也需要我们开发者去注意,根据不同的网络状态作相应的优化,以提升用户体验. 但通常我们只会判断用户是在WIFI还是移动数据,而实际上,移动数据也 ...
随机推荐
- 个人收藏的flex特效网址【经典中的极品】
http://www.noupe.com/adobe/flex-developers-toolbox-free-components-themes-and-tutorials.html经典中的经典 h ...
- PHP问题Parse error: syntax error, unexpected end of file in
检查一下你的php文件中是否存在这样的语法错误:<<php{>或者<?{?>以上两种写法都是有错误的,修改为下面的就可以了: <?php}?>
- HP P2055d激光打印机PCL XL error的解决
近日,于客户处安装HP P2055d激光打印机(2009年11月份生产的机器),介绍下硬件环境:PC:Dell OptiPlex 360,另有一台富士通DPK 8600E票据打印机,P2055d通过U ...
- Dubbo框架中的应用（两）--服务治理
Dubbo服务治理了看法 watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvbGlzaGVoZQ==/font/5a6L5L2T/fontsize/400/fi ...
- Android 手动显示和隐藏软键盘
1.方法一(如果输入法在窗口上已经显示,则隐藏,反之则显示) InputMethodManager imm = (InputMethodManager) getSystemService(Contex ...
- iOS 复杂动画之抽丝剥茧
一.前言 随着开发者的增多和时间的累积,AppStore已经有非常多的应用了,每年都有很多新的APP产生.但是我们手机上留存的应用有限,所以如何吸引用户,成为产品设计的一项重要内容.其中炫酷的动画效果 ...
- DIV------使用 <div> 元素的网页布局
<!DOCTYPE html> <html> <head> <style type="text/css"> div#containe ...
- 理解JavaScript的定时器与回调机制
定时器方法 JavaScript是单线程的.虽然HTML5已经开始支持异步js了. JavaScript的setTimeout与setInterval看起来就像已经是多线程的了.但实际上setTime ...
- MD5 SHA-1 示例
测试代码 public class SignatureUtils { public static void main(String[] args) throws Exception { ...
- Rouh set 入门知识3（上下近似集，正负域，边界域）
在RS中,引入两个概念:一个是下近似集,另一个是上近似集.下近似集是指当一个集合不能利用有效的等价关系被恰当的分类是时,则可通过另外的集合来达到这个集合的近似.形式上,设X⊆U是任一子集,R是U上的等 ...