「最強最速アルゴリズマー」のキウイジュースの問題をGoで写経してみた

gistfile1.go

package main

import (
    "fmt"
)

func main() {
    capacities := []int{20, 20}
    bottles := []int{5,8}
    fromId := []int{0}
    toId := []int{1}
    s := thePouring(capacities, bottles, fromId, toId)
    fmt.Println(s)
}

func thePouring(capacities, bottles, fromId, toId []int) []int {
    for i := 0; i < len(fromId); i++ {
        f := fromId[i]
        t := toId[i]
        space := capacities[t] - bottles[t]

        if (space >= bottles[f]) {
            vol := bottles[f]
            bottles[t] += vol
            bottles[f] = 0
        } else {
            vol := space
            bottles[t] += vol
            bottles[f] -= vol
        }
    }
    return bottles[:len(bottles)]
}