nn.go 4.2 KB

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