-
-
Save lardratboy/f539d829a32d5862c6a6 to your computer and use it in GitHub Desktop.
Test
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package test; | |
public class Test { | |
static int[][] MAP_A = { | |
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, | |
{0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, | |
{0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0}, | |
{0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0}, | |
{0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,1,1,0}, | |
{0,0,0,0,1,0,0,1,1,1,1,0,0,0,1,1,0,0}, | |
{0,0,0,0,1,1,1,1,1,1,1,0,0,1,1,1,0,0}, | |
{0,0,0,0,1,1,1,1,1,0,1,1,1,0,0,0,0,0}, | |
{0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0} | |
}; | |
static int[][] MAP_B = { | |
{1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0}, | |
{1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0}, | |
{1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0}, | |
{1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0}, | |
{1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0}, | |
{1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0}, | |
{1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0} | |
}; | |
static int[][] MAP_C = { | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, | |
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0} | |
}; | |
// ------------------------------------------------------------------------- | |
static void FLOOD_FILL( int [][] map, int rows, int cols, int row, int col, int value ) { | |
int search = map[ row ][ col ]; | |
if ( search == value ) return; | |
map[ row ][ col ] = value; | |
if ( 1 <= col ) if ( search == map[ row ][ col - 1 ] ) FLOOD_FILL( map, rows, cols, row, col - 1, value ); | |
if ( (cols - 1) > col ) if ( search == map[ row ][ col + 1 ] ) FLOOD_FILL( map, rows, cols, row, col + 1, value ); | |
if ( 1 <= row ) if ( search == map[ row - 1 ][ col ] ) FLOOD_FILL( map, rows, cols, row - 1, col, value ); | |
if ( (rows - 1) > row ) if ( search == map[ row + 1 ][ col ] ) FLOOD_FILL( map, rows, cols, row + 1, col, value ); | |
} | |
static class IslandDataResults { | |
public IslandDataResults() {} | |
public int [][] input; | |
public int [][] output; | |
public int islands; | |
public int rows; | |
public int cols; | |
} | |
static IslandDataResults ISLAND_FINDER( int [][] map ) { | |
int rows = map.length; | |
int cols = map[0].length; // ASUMPTION that this is NOT a ragged array (should error check) | |
// clone our map and make our output | |
int [][] working = map.clone(); | |
int [][] output = map.clone(); | |
for ( int row = 0; row < rows; ++row ) { | |
working[ row ] = map[ row ].clone(); | |
output[ row ] = map[ row ].clone(); | |
} | |
int islands = 0; | |
for ( int row = 0; row < rows; ++row ) { | |
for ( int col = 0; col < cols; ++col ) { | |
if ( 0 != working[ row ][ col ] ) { | |
++islands; | |
FLOOD_FILL( output, rows, cols, row, col, islands ); | |
FLOOD_FILL( working, rows, cols, row, col, 0 ); | |
} | |
} | |
} | |
IslandDataResults results = new IslandDataResults(); | |
results.input = map; | |
results.output = output; | |
results.islands = islands; | |
results.rows = rows; | |
results.cols = cols; | |
return results; | |
} | |
static void DISPLAY_ISLAND( IslandDataResults results, String zero ) { | |
System.out.printf( "\nmap has (%0$d) islands\n", results.islands ); | |
int rows = results.rows; | |
int cols = results.cols; | |
int [][] map = results.output; | |
for ( int row = 0; row < rows; ++row ) { | |
for ( int col = 0; col < cols; ++col ) { | |
int v = map[ row ][ col ]; | |
if ( 0 != v ) { | |
System.out.print( Integer.toString(v) ); | |
} else { | |
System.out.print( zero ); | |
} | |
} | |
System.out.println(); | |
} | |
} | |
// ------------------------------------------------------------------------- | |
public static void main(String[] args) { | |
DISPLAY_ISLAND( ISLAND_FINDER( MAP_A ), "-" ); | |
DISPLAY_ISLAND( ISLAND_FINDER( MAP_B ), "-" ); | |
DISPLAY_ISLAND( ISLAND_FINDER( MAP_C ), "-" ); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment