restructure: arrays and slices

16-slices/04-slices-vs-arrays-unique-nums/02-with-slices/main.go

@@ -0,0 +1,56 @@
+// For more tutorials: https://blog.learngoprogramming.com
+//
+// Copyright © 2018 Inanc Gumus
+// Learn Go Programming Course
+// License: https://creativecommons.org/licenses/by-nc-sa/4.0/
+//
+
+package main
+
+import (
+	"fmt"
+	"math/rand"
+	"os"
+	"sort"
+	"strconv"
+	"time"
+)
+
+func main() {
+	rand.Seed(time.Now().UnixNano())
+
+	max, _ := strconv.Atoi(os.Args[1])
+
+	// declare an uninitialized nil slice
+	var uniques []int
+
+loop:
+	// you can still use the len function on a nil slice
+	for len(uniques) < max {
+		n := rand.Intn(max) + 1
+		fmt.Print(n, " ")
+
+		for _, u := range uniques {
+			if u == n {
+				continue loop
+			}
+		}
+
+		// append function can add new elements to a slice
+		uniques = append(uniques, n)
+
+		// a slice doesn't contain any elements right from the start
+		// uniques[found] = n
+		// found++
+	}
+
+	fmt.Println("\n\nuniques:", uniques)
+	fmt.Println("\nlength of uniques:", len(uniques))
+
+	sort.Ints(uniques)
+	fmt.Println("\nsorted:", uniques)
+
+	nums := [5]int{5, 4, 3, 2, 1}
+	sort.Ints(nums[:])
+	fmt.Println("\nnums:", nums)
+}