nn.go 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  1. package qznn
  2. import "github.com/sirupsen/logrus"
  3. func WinLevel(leftNum, rightNum []uint32) (bool, bool, int) {
  4. //优先处理,下面会覆盖掉花色
  5. maxLeft, suitLeft := FindMaxCardInList(leftNum)
  6. maxRight, suitRight := FindMaxCardInList(rightNum)
  7. leftNum = TransCardNum(leftNum)
  8. rightNum = TransCardNum(rightNum)
  9. pointLeft := GetNiuniuPoint(leftNum)
  10. pointRight := GetNiuniuPoint(rightNum)
  11. isWuhuaLeft := IsWuhuaWuXiaoSiZha(leftNum)
  12. isWuhuaRight := IsWuhuaWuXiaoSiZha(rightNum)
  13. logrus.Infof("left is wx:%v, right is wx:%v", isWuhuaLeft, isWuhuaRight)
  14. if isWuhuaLeft && !isWuhuaRight {
  15. return true, false, 3
  16. }
  17. if !isWuhuaLeft && isWuhuaRight {
  18. return false, false, 0
  19. }
  20. if isWuhuaLeft && isWuhuaRight {
  21. //五花<四炸<五小
  22. if IsWuhuaNiu(leftNum) && !IsWuhuaNiu(rightNum) {
  23. return true, false, 4
  24. }
  25. if IsSiZha(leftNum) && IsWuhuaNiu(rightNum) {
  26. return false, false, 0
  27. }
  28. if IsSiZha(leftNum) && IsWuXiaoNiu(rightNum) {
  29. return true, false, 4
  30. }
  31. if IsWuXiaoNiu(leftNum) && !IsWuXiaoNiu(rightNum) {
  32. return false, false, 0
  33. }
  34. //相同的情况,比花色
  35. if maxLeft > maxRight {
  36. return true, false, 4
  37. }
  38. if maxLeft == maxRight {
  39. if suitLeft > suitRight {
  40. return true, false, 4
  41. }
  42. if suitLeft == suitRight {
  43. return false, true, 0
  44. }
  45. if suitLeft < suitRight {
  46. return false, false, 0
  47. }
  48. }
  49. if maxLeft < maxRight {
  50. return false, false, 0
  51. }
  52. }
  53. isLeftWin := false
  54. if pointLeft > pointRight {
  55. isLeftWin = true
  56. }
  57. if pointLeft == pointRight {
  58. if maxLeft > maxRight {
  59. isLeftWin = true
  60. }
  61. if maxLeft == maxRight {
  62. if suitLeft > suitRight {
  63. isLeftWin = true
  64. }
  65. //和的情况
  66. if suitLeft == suitRight {
  67. return false, true, 0
  68. }
  69. }
  70. }
  71. if isLeftWin {
  72. if pointLeft == 7 || pointLeft == 8 || pointLeft == 9 {
  73. return true, false, 2
  74. }
  75. if pointLeft == 10 {
  76. return true, false, 3
  77. }
  78. return true, false, 1
  79. }
  80. return false, false, 0
  81. }
  82. func IsWuhuaNiu(numList []uint32) bool {
  83. for _, item := range numList {
  84. if item <= 10 {
  85. return false
  86. }
  87. }
  88. return true
  89. }
  90. func IsWuXiaoNiu(numList []uint32) bool {
  91. total := 0
  92. for _, item := range numList {
  93. if item >= 5 {
  94. return false
  95. }
  96. total += int(item)
  97. }
  98. return total < 10
  99. }
  100. func IsSiZha(numList []uint32) bool {
  101. numMap := map[uint32]int{}
  102. for _, item := range numList {
  103. // if item >= 5 {
  104. // return false
  105. // }
  106. numMap[item] = numMap[item] + 1
  107. }
  108. if len(numMap) == 1 {
  109. return true
  110. }
  111. for _, item := range numMap {
  112. if item >= 4 {
  113. return true
  114. }
  115. }
  116. // if numMap[0] == 4 || numMap[1] == 4 {
  117. // return true
  118. // }
  119. return false
  120. }
  121. func IsWuhuaWuXiaoSiZha(numList []uint32) bool {
  122. if IsWuhuaNiu(numList) {
  123. return true
  124. }
  125. if IsWuXiaoNiu(numList) {
  126. return true
  127. }
  128. if IsSiZha(numList) {
  129. return true
  130. }
  131. return false
  132. }
  133. func IsWuhuaWuXiaoSiZhaDesc(numList []uint32) (bool, string) {
  134. if IsWuhuaNiu(numList) {
  135. return true, "五花牛"
  136. }
  137. if IsWuXiaoNiu(numList) {
  138. return true, "五小牛"
  139. }
  140. if IsSiZha(numList) {
  141. return true, "四炸"
  142. }
  143. return false, ""
  144. }
  145. func TransCardNum(openNumberList []uint32) []uint32 {
  146. resultList := make([]uint32, len(openNumberList))
  147. for index, item := range openNumberList {
  148. val := item % 13
  149. if val == 0 {
  150. val = 13
  151. }
  152. resultList[index] = val
  153. }
  154. return resultList
  155. }
  156. func FindMaxCardInList(cardList []uint32) (num uint32, suit uint32) {
  157. num = 0
  158. suit = 0
  159. for _, item := range cardList {
  160. formatItem := item % 13
  161. if formatItem == 0 {
  162. formatItem = 13
  163. }
  164. if num == formatItem {
  165. newSuit := (item - 1) / 13
  166. if newSuit > suit {
  167. suit = newSuit
  168. }
  169. }
  170. if num < formatItem {
  171. num = formatItem
  172. suit = (item - 1) / 13
  173. }
  174. }
  175. return num, suit
  176. }
  177. func GetNiuniuPoint(numList []uint32) int {
  178. numList = TransCardNum(numList)
  179. for i := 0; i < len(numList); i++ {
  180. if numList[i] > 10 {
  181. numList[i] = 10
  182. }
  183. }
  184. for i := 0; i < 3; i++ {
  185. for j := i + 1; j < 4; j++ {
  186. for k := j + 1; k < 5; k++ {
  187. num1 := numList[i]
  188. num2 := numList[j]
  189. num3 := numList[k]
  190. if (num1+num2+num3)%10 != 0 {
  191. continue
  192. }
  193. pointTotal := uint32(0)
  194. for f := 0; f < 5; f++ {
  195. if f != i && f != j && f != k {
  196. pointTotal += numList[f]
  197. }
  198. }
  199. if pointTotal%10 == 0 {
  200. return 10
  201. }
  202. return int(pointTotal % 10)
  203. }
  204. }
  205. }
  206. return 0
  207. }