在一个字符串数组中找到最常见的元素。

huangapple
go评论114阅读模式
英文:

Find the most common element in a string array GO

问题

我是你的中文翻译助手，以下是你要翻译的内容：

我对Go语言还比较新手，我在一个数组（Windrichting）中找不到最常见的字符串。应该是"N"，但我的输出却是"W"（它总是给我最后一个字符串Windrichting[6]）。有人可以帮忙吗？

这是我的代码：

  1. package main
  3. import "fmt"
  5. func main() {
  6.     Windrichting := [7]string{"N", "N", "N", "N", "O", "Z", "W"}
  8.     windEL, winner := Mostcommon(Windrichting)
  10.     fmt.Printf("Mostcommon windrichting: %s\n", windEL)
  11.     fmt.Printf("Komt %d x voor\n", winner)
  12. }
  14. func Mostcommon(Windrichting [7]string) (windEL string, winner int) {
  15.     var N int
  16.     var O int
  17.     var Z int
  18.     var W int
  19.     Windrichtingbase := [4]string{"N", "O", "Z", "W"}
  21.     for _, v := range Windrichting {
  22.         switch v {
  23.         case Windrichtingbase[0]:
  24.             N++
  25.             if N > winner {
  26.                 winner = N
  27.                 windEL = "Noord"
  28.             }
  29.         case Windrichtingbase[1]:
  30.             O++
  31.             if O > winner {
  32.                 winner = O
  33.                 windEL = "Oost"
  34.             }
  35.         case Windrichtingbase[2]:
  36.             Z++
  37.             if Z > winner {
  38.                 winner = Z
  39.                 windEL = "Zuid"
  40.             }
  41.         case Windrichtingbase[3]:
  42.             W++
  43.             if W > winner {
  44.                 winner = W
  45.                 windEL = "West"
  46.             }
  47.         }
  48.     }
  49.     return windEL, winner
  50. }

输出截图

英文:

i'm fairly new to golang and im having trouble finding the most common string in an array (Windrichting). it should be N but my output gives me W (it always gives me the last string so Windrichting[6]. Can someone help?

this is my code:

package main

  1. import "fmt"
  3. func main() {
  4. 	Windrichting := [7]string{"N", "N", "N", "N", "O", "Z", "W"}
  6. windEL, winner := Mostcommon(Windrichting)
  8. fmt.Printf("Mostcommon windrichting: %s\n", windEL)
  9. fmt.Printf("Komt %d x voor\n", winner)
  10. }
  13. func Mostcommon(Windrichting [7]string) (windEL string, winner int) {
  14. 	var N int
  15. 	var O int
  16. 	var Z int
  17. 	var W int
  18. 	Windrichtingbase := [4]string{"N", "O", "Z", "W"}
  20. for _, v := range Windrichting {
  21. 	switch v {
  22. 	case Windrichtingbase[0]:
  23. 		N++
  24. 		if N > winner {
  25. 			N = winner
  26. 			windEL = "Noord"
  27. 		}
  28. 	case Windrichtingbase[1]:
  29. 		O++
  30. 		if O > winner {
  31. 			O = winner
  32. 			windEL = "Oost"
  33. 		}
  34. 	case Windrichtingbase[2]:
  35. 		Z++
  36. 		if Z > winner {
  37. 			Z = winner
  38. 			windEL = "Zuid"
  39. 		}
  40. 	case Windrichtingbase[3]:
  41. 		W++
  42. 		if W > winner {
  43. 			W = winner
  44. 			windEL = "West"
  45. 		}
  46. 	}
  47. }
  48. return windEL, winner
  49. }

output

答案1

得分: 1

赢家始终为0，你从未更新它。然后，在增加方向变量（N、O、Z和W）之后，你立即用存储在赢家中的零值覆盖它们。你需要改变赋值的顺序。

就像这个变化一样：https://go.dev/play/p/VaJgZcijFdh

还要注意，Go中的大写变量表示它们是可导出的。

英文:

winner is always 0 and you never update it. then after incrementing your direction variables (N, O, Z and W), you immediately overwrite them with the zero value stored in winner. You need to reverse the order of the assignment.

Like in this change: https://go.dev/play/p/VaJgZcijFdh

Note also, that capitalized variables in Go mean they're exported

答案2

得分: 0

这是一个替代实现。它使用直方图来收集单词出现的次数。然后通过直方图遍历来找到最常见的单词。没有硬编码。

https://go.dev/play/p/wTFvNaPRP6B

英文:

Here's an alternate implementation. It uses a histogram to collect the number of times a word appears. It then steps through the histogram to find the most common word. Nothing is hard-coded.

https://go.dev/play/p/wTFvNaPRP6B

huangapple
  • 本文由 发表于 2021年12月23日 07:15:02
  • 转载请务必保留本文链接：https://go.coder-hub.com/70456107.html
  • go
匿名

发表评论

匿名网友

:?: :razz: :sad: :evil: :!: :smile: :oops: :grin: :eek: :shock: :???: :cool: :lol: :mad: :twisted: :roll: :wink: :idea: :arrow: :neutral: :cry: :mrgreen:

确定