Qunar大连开发笔试第3题解法

1.

1. public class WordEntity implements Comparable {
2.     private Integer count = null;
3. 
   
4.     public String getWord() {
5.         return word;
6.     }
7. 
   
8.     public void setWord(String word) {
9.         this.word = word;
10.     }
11. 
    
12.     public Integer getCount() {
13.         return count;
14.     }
15. 
    
16.     public void setCount(Integer count) {
17.         this.count = count;
18.     }
19. 
    
20.     private String word = null;
21. 
    
22.     public WordEntity(String word, Integer count) {
23.         this.count = count;
24.         this.word = word;
25.     }
26. 
    
27.     @Override
28.     public int compareTo(WordEntity o) {
29.         int cmp = count.intValue() - o.count.intValue();
30.         return (cmp == 0 ? word.compareTo(o.word) : -cmp);
31.     }
32. }

2.

1. import sun.reflect.generics.tree.Tree;
2. 
   
3. import java.util.HashMap;
4. import java.util.Iterator;
5. import java.util.Set;
6. import java.util.TreeSet;
7. 
   
8. public class CountString {
9. 
   
10.     public static TreeSet set = new TreeSet();
11. 
    
12.     public static TreeSet outputStrs(String[] args) {
13. 
    
14.         int count = 0;
15.         for (int i = 0; i < args.length; i++) {
16.             String temp = args[i].replaceAll("your", "");
17.             count = (args[i].length() - temp.length()) / "your".length();
18.             if (count > 0) {
19.                 set.add(new WordEntity(args[i], count));
20.             }
21.         }
22. 
    
23.         return set;
24.     }
25. 
    
26.     public static void main(String[] args) {
27.         String[] strings = {"your", "assfyour", "dsfdfyouryour"};
28. 
    
29.         TreeSet hi = outputStrs(strings);
30.         for (Iterator he = hi.iterator(); he.hasNext(); ) {
31.             WordEntity w = he.next();
32.             System.out.println(w.getWord());
33.         }
34.     }
35. 
    
36. }