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还是移动数据,而实际上,移动数据也 ...
随机推荐
- C#语法糖之开篇
本人虽然大学不是学的计算机但是对于IT行业的热爱,依然决然进军IT行业了,自从踏进这个行业到现在也已经3年多了,从去年开发通过网上 了解博客园后深深的爱上这儿了,这里有很多牛人,通过拜读他们的代码,让 ...
- SQL Server 表字段值转换成字段名称(二)
上次写了个比较简单的只有两个字段的例子,经要求在写个 3 个字段的示例 ,贴上来与大家共勉一下 如果你们有更好的方法,提供一下, 感激不尽. 示例如下: /*--drop table temp_ ...
- 那些年,我们一起学WCF--(7)PerSession实例行为
这一节,大家了解下PerSession实例行为,PerSession表示会话实例行为,当客户端调用服务器后,服务器端会为客户端分配一个新的服务实例,这个实例在服务器端SESSION时间过期后将失效.客 ...
- >/dev/null 2>&1 这句话的含义
1表示标准输出,2表示标准错误输出 2>&1表示将标准错误输出重定向到标准输出,这样,程序或者命令的正常输出和错误输出就可以在标准输出输出(也就是一起输出). 一般来讲标准输出和标准错误 ...
- SGU 231.Prime Sum
题意: 求有多少对质数(a,b)满足a<=b 且a+b也为质数.(a+b<=10^6) Solution: 除了2之外的质数都是奇数,两个奇数的和是偶数,不可能是质数.所以题目就是求差为2 ...
- Grunt:多个css,js,进行单独压缩
module.exports = function (grunt) { // 构建任务配置 grunt.initConfig({ //读取package.json的内容,形成个json数据 pkg: ...
- Meta元素可视区
一.网页手机wap2.0网页的head里加入下面这条元标签,在iPhone的浏览器中页面将以原始大小显示,并不允许缩放. <meta name="viewport" cont ...
- WPF之核心面板（容器）控件简单介绍
一.Canvas 1.官方表述:定义一个区域,在该区域中可以使用相对于该区域的坐标显式定位子元素. 2.对于canvas 的元素的位置,是靠控件的大小及Canvas.Top.Canvas.Left.C ...
- Eclipse中修改Maven Repository
1. 下载最新的Maven,解压到目录下 Maven下载地址: http://maven.apache.org/download.cgi 2. 修改config/settings.xml文件,在loc ...
- PHP图片操作
<?php $filename="http://pic.nipic.com/2007-12-06/2007126102233577_2.jpg";//图片地址//获取图片信息 ...