有办法减少我的时间复杂度O(n ^ 2)?

I have made a program (hw), which count the frequency of all words. All of my algorithms takes O(n) or O(n log n), however my word counter takes O(n^2)I have made a program (hw), which count the fre