-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreceiveonlychannel.go
More file actions
95 lines (61 loc) · 1.77 KB
/
receiveonlychannel.go
File metadata and controls
95 lines (61 loc) · 1.77 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
/*** author
BGH25333
***/
package main
import (
"fmt"
"bufio"
"os"
"strings"
)
func main(){
scanner := bufio.NewScanner(os.Stdin)
fmt.Println("Enter an array of strings in a line ")
fmt.Println("")
fmt.Println( "For eg: str1 str2 str3 ")
fmt.Println("")
scanner.Scan()
input:= scanner.Text()
var strArray []string= strings.Fields(input)
fmt.Println("")
fmt.Println("")
longest := make(chan string)
palindrome := make(chan []string)
go FindLongestWord(longest,strArray)
go CheckPalindrome(palindrome,strArray)
fmt.Println("Received longest word from channel: ",<-longest)
fmt.Println("Received palindrome strings from channel: ",<-palindrome)
}
func FindLongestWord(longest chan string, strArray []string) <-chan string {
max := strArray[0]
for _, value := range strArray {
if len(value) > len(max) {
max = value
}
}
longest<- max
return longest
}
func CheckPalindrome(palindrome chan []string, strArray []string) <-chan []string {
var result []string
for _,value := range strArray {
isOK:= IsPalindrome(value)
if(isOK ==true){
result = append(result, value)
}
}
palindrome <- result
return palindrome
}
func IsPalindrome(input string) bool {
var result string
// reverse the input string and compare the result with input string
//here, index not required. So, using blank identifier _.
for _,v := range input {
result= string(v) + result
}
if input== result {
return true
}
return false
}