#!/usr/bin/python

grid = []
row = (0, 0, 0, 0, 0, 0)
grid.append(row)
row = (0, 1, 0, 1, 0, 0)
grid.append(row)
row = (0, 1, 0, 1, 0, 0)
grid.append(row)
row = (0, 1, 0, 0, 0, 0)
grid.append(row)
row = (0, 0, 0, 0, 0, 0)
grid.append(row)
row = (0, 0, 0, 0, 0, 0)
grid.append(row)

i = 0 
j = 0 
islands = 0
forgetit = False

# basically, if you are a zero, forget it.  If you are a 1, check all the upcoming
# adjacent spots and if they have a 1 don't count the island because you'll get it later
while i < len(grid):
   while j < len(row): 
      if grid[i][j] == 0:  
         j += 1
         forgetit = False
         continue 
      if j > 0 and i < len(grid) - 1: #down one and back one if exists
          if grid[i+1][j-1] == 1:
             j += 1
             forgetit = True
             continue
      if i < len(grid) - 1:  # look below if there is a below
         if grid[i+1][j] == 1: 
             j += 1
             continue
      if j < len(row) - 1 and i < len(grid) - 1: # down one and forward one, if there is such a place
         if grid[i+1][j+1] == 1:
             j += 1
             continue
      if j < len(row) - 1:  # look forward if there is a forward
         if grid[i][j+1] == 1: 
            j += 1
            continue
         if forgetit:  #it overcounts one case
            forgetit = False
            islands = islands - 1
      j += 1
      islands += 1
   j = 0
   i += 1

print("islands = ", islands)

#/usr/bin/python

grid = []
row = [[1,0], [0,0], [0,0], [1,0], [0,0], [1,0]]
grid.append(row)
row = [[1,0], [0,0], [0,0], [1,0], [1,0], [1,0]]
grid.append(row)
row = [[0,0], [0,0], [1,0], [0,0], [0,0], [1,0]]
grid.append(row)
row = [[0,0], [1,0], [0,0], [0,0], [1,0], [0,0]]
grid.append(row)
row = [[0,0], [0,0], [0,0], [1,0], [0,0], [0,0]]
grid.append(row)
row = [[1,0], [0,0], [1,0], [1,0], [0,0], [0,0]]
grid.append(row)

def pointexists(i, j):
    if 0 <= i < len(grid) and 0 <= j < len(row):
        return True
    else:
        return False

def doallthatchecking(loadcheckneighbors):
    for check in loadcheckneighbors:
        checkneighbors(check[0], check[1], check[2])

def checkneighbors(i, j, fam):
    loadcheckneighbors = []
    if pointexists(i, j+1):
        if grid[i][j+1][0] == 1 and grid[i][j+1][1] == 0:
            grid[i][j+1][1] = fam
            loadcheckneighbors.append([i, j+1, fam])
    if pointexists(i+1, j+1):
        if grid[i+1][j+1][0] == 1 and grid[i+1][j+1][1] == 0:
            grid[i+1][j+1][1] = fam
            loadcheckneighbors.append([i+1, j+1, fam])
    if pointexists(i+1, j-1):
        if grid[i+1][j-1][0] == 1 and grid[i+1][j-1][1] == 0:
            grid[i+1][j-1][1] = fam
            loadcheckneighbors.append([i+1, j-1, fam])
    if pointexists(i+1, j):
        if grid[i+1][j][0] == 1 and grid[i+1][j][1] == 0:
            grid[i+1][j][1] = fam
            loadcheckneighbors.append([i+1, j, fam])
    if pointexists(i-1, j):
        if grid[i-1][j][0] == 1 and grid[i-1][j][1] == 0:
            grid[i-1][j][1] = fam
            loadcheckneighbors.append([i-1, j, fam])
    if pointexists(i, j-1):
        if grid[i][j-1][0] == 1 and grid[i][j-1][1] == 0:
            grid[i][j-1][1] = fam
            loadcheckneighbors.append([i, j-1, fam])
    doallthatchecking(loadcheckneighbors)

i=0
j=-1
fam = 0
while i < len(grid):
    while j < len(row) - 1: 
        j += 1
        if grid[i][j][1] != 0:
            continue
        if grid[i][j][0] == 1:
            fam += 1
            grid[i][j][1] = fam
            checkneighbors(i, j, fam)            
    i += 1
    j = -1

print("number of islands: ", fam)

    {
      "Sid": "f8ae84c0-399b-4b52-9763-19c47522d69d",
      "Effect": "Allow",
      "Principal": {
        "Service": "apigateway.amazonaws.com"
      },
      "Action": "lambda:InvokeFunction",
      "Resource": "arn:aws:lambda:us-west-2:906624224980:function:cy-store-data",
      "Condition": {
        "ArnLike": {
          "AWS:SourceArn": "arn:aws:execute-api:us-west-2:906624224980:iagz1uefr1/*/POST/compare-yourself"
        }
      }
    },