public static void main(String[] args) { final int CART_ARRAY_LEN = 54; int[] carts = new int[CART_ARRAY_LEN]; for(int i=0;i<CART_ARRAY_LEN;i++){ carts[i]=i+1; } for (int i = 0; i <CART_ARRAY_LEN ; i++) { int rdmNum1 = (int) (Math.random() * 54); int rdmNum2 = (int) (Math.random() * 54); int temp = carts[rdmNum1]; carts[rdmNum1] = carts[rdmNum2]; carts[rdmNum2] = temp; } for(int i=0;i<CART_ARRAY_LEN;i++){ System.out.println(carts[i]); } }
}
定义一串字母的字符串,求出现最多的那个字母,出现了多少次!
public class Test { public static void main(String[] args) { String str = "dsfdsfsdfsdf"; Map<Character,Integer> d = new HashMap<Character, Integer>(); for(int i = 0;i<str.length();i++){ char c = str.charAt(i); if(d.containsKey(c)){ d.put(c, d.get(c)+1); } else{ d.put(c, 1); } } System.out.println(d); }
}
打印出一个字符串里面字母的出现次数
public static void printCount(String str){ Map<Character,Integer> map = new HashMap<Character,Integer>(); char[] charArray = str.toCharArray(); final int ARRAY_LEN = charArray.length; for (int i = 0; i < ARRAY_LEN; i++) { if(!map.containsKey(charArray[i])){ map.put(charArray[i], 1); } else{ int curCount = map.get(charArray[i]); map.put(charArray[i],curCount+1 ); } } for(Character c:map.keySet()){ System.out.println(c+"出现次数:"+map.get(c)); }