Check 2 consecutive ascii watches

X = led on

= no led / led off

    .XX...XX.....XX...XX.
    ...X....X...X....X..X
    ...X....X.X.X....X..X
    .XX...XX.....XX...XX.
    X.......X.X....X....X
    X.......X......X....X
    .XX...XX.....XX...XX.        <- 23:59

    ......XX.....XX...XX.
    .....X..X...X..X.X..X
    .....X..X.X.X..X.X..X
    .....................
    .....X..X.X.X..X.X..X
    .....X..X...X..X.X..X
    ......XX.....XX...XX.        <- 0:00

    ......XX.....XX...XX.
    .....X..X...X..X....X
    .....X..X.X.X..X....X
    .....................
    .....X..X.X.X..X....X
    .....X..X...X..X....X
    ......XX.....XX...XX.       <- 0:01 leds always on





  ----------------------------------
    Correct form of 0:01:
    ......XX.....XX......
    .....X..X...X..X....X
    .....X..X.X.X..X....X
    .....................
    .....X..X.X.X..X....X
    .....X..X...X..X....X
    ......XX.....XX......   

I keep them in variables d public char [] [] [] clock (public char [watch number] [x] [y] clock)

the program must deliver as result all leds that are burned, always on, that can not be determined, or good. Each clock must be successor to the previous one.

I need some advice to compare that they are consecutive knowing that they can have LEDs that are always lit or burnt LEDs.