分享一个大牛的人工智能教程。零基础！通俗易懂！风趣幽默！希望你也加入到人工智能的队伍中来！请轻击http://www.captainbed.net

package live.every.day.Programming.String;/*** 题目：* 判断字符数组中是否所有的字符都只出现过一次。** 思路：* 使用map，map可以用长度固定的数组出现，也可以用哈希表实现。** @author Created by LiveEveryDay*/public class IsAllCharsAppearOnlyOnce {public static boolean isUnique(char[] a) {if (a == null) {return true;}boolean[] map = new boolean[256];for (char c : a) {if (map[c]) {return false;}map[c] = true;}return true;}public static void main(String[] args) {char[] a = {'a', 'b', 'c'};System.out.printf("Is all characters appear only once: %s", isUnique(a));}}// ------ Output ------
/*
Is all characters appear only once: true
*/