void continuityNum(Integer[] ns) {
List<Integer> c = new LinkedList<Integer>(); // 连续的子数组
c.add(ns[0]);
int count = 0;
int charNum = 0;
for (int i = 0; i < ns.length - 1; ++i) {
if (ns[i] + 1 == ns[i + 1]) {
c.add(ns[i + 1]);
} else {
if (c.size() > 1) {
count++;
charNum += c.size();
}
c.clear();
c.add(ns[i + 1]);
}
}
if (c.size() > 1) {
charNum += c.size();
count++;
}
}