c0d3 solved in Go

algo3.go

func solution8(num1, num2 int) int {
        var list []int         
        var biggerNum int      

        if num1 > num2 {       
                biggerNum = num1        
        } else {               
                biggerNum = num2        
        }
    
        for i := 1; i < biggerNum; i++ {
                if (num1 % i == 0 && num2 % i == 0) { 
                        list = append(list, i)  
                }              
        }
    
        max := list[0]         

        for _, value := range list {
                if value > max {        
                        max = value             
                }              
        }
    
        return max             
}