java实现——035第一个只出现一次的字符

 1 import java.util.Hashtable;
 2 
 3 public class T035 {
 4     public static void main(String[] args) {
 5         FirstNotRepeatingChar("abaccdeff");
 6     }
 7 
 8     public static char FirstNotRepeatingChar(String pString) {
 9         Hashtable t = new Hashtable();
10         int tableSize = 256;
11         for (int i = 0; i < tableSize; i++) {
12             t.put(i, 0);
13         }
14 
15         for (int i = 0; i < pString.length(); i++) {
16             int key = pString.charAt(i);
17             int value = (Integer) t.get(key);
18             t.remove(key);
19             t.put(key, ++value);
20         }
21         int i;
22         for (i = 0; i < pString.length(); i++) {
23             int key = pString.charAt(i);
24             int value = (Integer) t.get(key);
25             if (value == 1) {
26                 System.out.println(pString.charAt(i));
27                 break;
28             }
29         }
30         if (i == pString.length()) {
31             System.out.println("none");
32         }
33         return 0;
34     }
35 }