打牌里面经常出现的5张牌:一个顺子带一对。给你五张牌,比如:1,2,2,2,3或者5,6,7,4,4或者2,4,3,5,5或者7,5,9,6,9, 这种情况就符合一个顺子带一对,则返回true,反之比如:1,3,4,6,6或者1,5,5,3,4这种返回false。
直接上代码:
public static boolean qingChuPai(String ss) { boolean flag = false; StringBuffer sb = new StringBuffer(); char cc[] = ss.toCharArray(); Arrays.sort(cc); for (int i = 0; i < cc.length; i++) { if (sb.toString().contains(String.valueOf(cc[i])) && i == 1 || sb.toString().contains(String.valueOf(cc[i])) && i == 3) { sb.replace(0, 1, ""); continue; } else if (sb.toString().contains(String.valueOf(cc[i])) && i == 2) { sb.replace(1, 2, ""); continue; } else if (sb.toString().contains(String.valueOf(cc[i])) && i == 3) { sb.replace(2, 3, ""); continue; } if (!sb.toString().contains(String.valueOf(cc[i]))) { sb.append(cc[i]); } } char ct[] = sb.toString().toCharArray(); if (ct.length <= 2) { return flag; } for (int i = 0; i < ct.length; i++) { int temp = ct[i]; if (temp == ct[i + 1] - 1 && temp == ct[i + 2] - 2 && ct.length <= cc.length - 1) { flag = true; break; } else { flag = false; break; } } return flag; }如有不足欢迎指点。如对您有帮助欢迎点赞。