-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcircular-sentence.go
56 lines (50 loc) · 1.08 KB
/
circular-sentence.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
package main
import (
"fmt"
"strings"
)
// source: https://leetcode.com/problems/circular-sentence/
func isCircularSentence(sentence string) bool {
words := strings.Split(sentence, " ")
n := len(words)
for i := 0; i < n-1; i++ {
if words[i][len(words[i])-1] != words[i+1][0] {
return false
}
}
return words[n-1][len(words[n-1])-1] == words[0][0]
}
func main() {
testCases := []struct {
sentence string
want bool
}{
{
sentence: "leetcode exercises sound delightful",
want: true,
},
{
sentence: "eetcode",
want: true,
},
{
sentence: "Leetcode is cool",
want: false,
},
}
successes := 0
for _, tc := range testCases {
x := isCircularSentence(tc.sentence)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}