-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminiMaxSum.go
67 lines (56 loc) · 1.08 KB
/
miniMaxSum.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package main
import (
"bufio"
"fmt"
"io"
"os"
"sort"
"strconv"
"strings"
)
/*
* Complete the 'miniMaxSum' function below.
*
* The function accepts INTEGER_ARRAY arr as parameter.
*/
func miniMaxSum(arr []int32) {
// Write your code here
var sums []int64
var sum int64
var l int = len(arr)
for i := range arr {
for j := i; j < i+4; j++ {
sum += int64(arr[j%l])
}
sums = append(sums, sum)
sum = 0
}
sort.Slice(sums, func(i, j int) bool {
return sums[i] < sums[j]
})
fmt.Print(sums[0], sums[l-1])
}
func main() {
reader := bufio.NewReaderSize(os.Stdin, 16*1024*1024)
arrTemp := strings.Split(strings.TrimSpace(readLine(reader)), " ")
var arr []int32
for i := 0; i < 5; i++ {
arrItemTemp, err := strconv.ParseInt(arrTemp[i], 10, 64)
checkError(err)
arrItem := int32(arrItemTemp)
arr = append(arr, arrItem)
}
miniMaxSum(arr)
}
func readLine(reader *bufio.Reader) string {
str, _, err := reader.ReadLine()
if err == io.EOF {
return ""
}
return strings.TrimRight(string(str), "\r\n")
}
func checkError(err error) {
if err != nil {
panic(err)
}
}