您的位置:首页 > Web前端

剑指offer——扑克牌顺子

2017-07-11 07:03 204 查看
import java.util.*;

public class Solution {
public boolean isContinuous(int [] numbers) {
if(numbers == null || numbers.length != 5) return false;
for(int i = 0; i < numbers.length; ++i)
if(numbers[i] < 0 || numbers[i] > 13) return false;
int[] a = new int[14];
for(int i = 0; i < numbers.length; ++i) {
++a[numbers[i]];
}
for(int i = 0; i < a.length; ++i)
System.out.print(a[i] + " ");
System.out.println();
for(int i = 1; i < a.length-4; ++i) {
int count = 0;
for(int j = i; j <= i + 4; ++j) {
//System.out.println("a[" + j + "]" + " = " + a);
if(a[j] == 0) ++count;
}
//System.out.println("count = " + count);
if(count == a[0]) return true;
}
return false;
}

public static void main(String[] args) {
Solution solution = new Solution();
int array[] = new int[] {
1, 3, 2, 4, 6
};
solution.isContinuous(array);
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  二叉树