package dero

func max(a int, b int) int {

    if a > b {

        return a

    } else {

        return b

    }
}

func Max_sum_of_non_adjacent(slice [] int) int {

    prevOne := 0
    prevTwo := 0
    res     := 0

    for index,_ := range(slice) {

        if index == 0 {

            res = slice[0]

        } else if index == 1 {

            res = max(slice[0],slice[1])

        } else {

            res = max(prevOne,prevTwo + slice[index])

        }

        prevTwo = prevOne
        prevOne = res

    }

    return res
}