Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse code

Playing around with slices while solving 11

  • Loading branch information...
commit 1de95a8005eb4ef7245df67dc4f9635c36fa0909 1 parent c8a9fa7
Charles Leifer authored April 22, 2012

Showing 1 changed file with 100 additions and 0 deletions. Show diff stats Hide diff stats

  1. 100  go/problem11.go
100  go/problem11.go
... ...
@@ -0,0 +1,100 @@
  1
+package main
  2
+
  3
+import (
  4
+    "fmt"
  5
+    "strconv"
  6
+    "strings"
  7
+)
  8
+
  9
+const raw_numbers = `08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
  10
+49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
  11
+81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
  12
+52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
  13
+22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
  14
+24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
  15
+32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
  16
+67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
  17
+24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
  18
+21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
  19
+78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
  20
+16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
  21
+86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
  22
+19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
  23
+04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
  24
+88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
  25
+04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
  26
+20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
  27
+20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
  28
+01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48`
  29
+const arr_size = 20
  30
+const count = 4
  31
+
  32
+func convertNumbers() (numbers [][]int) {
  33
+    numbers = make([][]int, arr_size, arr_size)
  34
+    for i, line := range(strings.Split(raw_numbers, "\n")) {
  35
+        row := make([]int, arr_size, arr_size)
  36
+        for j, digits := range(strings.Split(line, " ")) {
  37
+            num, _ := strconv.Atoi(digits)
  38
+            row[j] = num
  39
+        }
  40
+        numbers[i] = row
  41
+    }
  42
+    return
  43
+}
  44
+
  45
+func lr(nums [][]int, i, j int) []int {
  46
+    return nums[i][j:j+count]
  47
+}
  48
+
  49
+func tb(nums [][]int, i, j int) (pieces []int) {
  50
+    for k := 0; k < count; k++ {
  51
+        pieces = append(pieces, nums[j+k][i])
  52
+    }
  53
+    return
  54
+}
  55
+
  56
+func dlr(nums [][]int, i, j int) (pieces []int) {
  57
+    if j > arr_size - count {
  58
+        return
  59
+    }
  60
+    for k := 0; k < count; k++ {
  61
+        pieces = append(pieces, nums[j+k][i+k])
  62
+    }
  63
+    return
  64
+}
  65
+
  66
+func drl(nums [][]int, i, j int) (pieces []int) {
  67
+    if j > arr_size - count {
  68
+        return
  69
+    }
  70
+    for k := 0; k < count; k++ {
  71
+        pieces = append(pieces, nums[j+count-k][i+k])
  72
+    }
  73
+    return
  74
+}
  75
+
  76
+
  77
+func main () {
  78
+    var largest int
  79
+    numbers := convertNumbers()
  80
+    checks := []func([][]int, int, int) []int {lr, tb, dlr, drl}
  81
+
  82
+    check_largest := func(nums []int) {
  83
+        product := 1
  84
+        for _, i := range(nums) {
  85
+            product *= i
  86
+        }
  87
+        if product > largest {
  88
+            largest = product
  89
+        }
  90
+    }
  91
+
  92
+    for i := 0; i < arr_size; i++ {
  93
+        for j := 0; j < arr_size - count; j++ {
  94
+            for i, check := range(checks) {
  95
+                check_largest(check(numbers, i, j))
  96
+            }
  97
+        }
  98
+    }
  99
+    fmt.Printf("%v\n", largest)
  100
+}

0 notes on commit 1de95a8

Please sign in to comment.
Something went wrong with that request. Please try again.