Merge pull request #2 from kennygrant/master

Triangles

Author: Aliaksandr Pliutau

floyd/cmd/cmd.go

@@ -0,0 +1,29 @@
+package main
+
+import (
+	"fmt"
+	"os"
+	"strconv"
+
+	"github.com/kennygrant/practice-go/floyd"
+)
+
+func main() {
+	if len(os.Args) < 2 {
+		fmt.Printf("Please supply the number of rows you want as an argument\n")
+		return
+	}
+
+	rows, err := strconv.Atoi(os.Args[1])
+	if err != nil {
+		panic(err)
+	}
+
+	for _, row := range floyd.Triangle(rows) {
+		for i := range row {
+			fmt.Printf("%-2d ", row[i])
+		}
+		fmt.Printf("\n")
+	}
+
+}

floyd/floyd.go

@@ -0,0 +1,15 @@
+package floyd
+
+// Triangle makes a Floyd's triangle matrix with rows count.
+func Triangle(rows int) [][]int {
+	triangle := make([][]int, rows)
+	var i int
+	for r := 0; r < rows; r++ {
+		triangle[r] = make([]int, r+1)
+		for c := 0; c < r+1; c++ {
+			i++
+			triangle[r][c] = i
+		}
+	}
+	return triangle
+}

floyd/floyd_test.go

@@ -19,7 +19,7 @@ var tests = []struct {
 
 func TestFloydTriangle(t *testing.T) {
 	for _, test := range tests {
-		actual := FloydTriangle(test.rowsCount)
+		actual := Triangle(test.rowsCount)
 		if len(actual) != len(test.expected) {
 			t.Fatalf("FloydTriangle(%d) expected length %d, got %d", test.rowsCount, len(test.expected), len(actual))
 		}
@@ -39,7 +39,7 @@ func TestFloydTriangle(t *testing.T) {
 func BenchmarkTestFloydTriangle(b *testing.B) {
 	for i := 0; i < b.N; i++ {
 		for _, test := range tests {
-			FloydTriangle(test.rowsCount)
+			Triangle(test.rowsCount)
 		}
 	}
 }