1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
| package com.lmay.demo;
public class NumberContinuous { public static void main(String[] args) { int[] x = {1, 22, 1, 3, 4, 6, 6, 7, 9, 9, 9, 2, 0, 0, 8, 8, 8, 8, 8, 23, 23, 56}; int beforeNumber = x[0]; int currCount = 1; int maxCount = 1; int maxContinuousNumber = 0; for(int i=1; i < x.length; ++i) { if(beforeNumber == x[i]) { ++currCount; } else { currCount = 1; } if(currCount > maxCount) { maxCount = currCount; maxContinuousNumber = beforeNumber; } beforeNumber = x[i]; } System.out.println("----------------- End -----------------"); System.out.println(maxContinuousNumber + "\t连续出现次数最多: " + maxCount + "次"); } }
|