[백준(Baekjoon)][자바(java)] 6996 : 애너그램

 

https://www.acmicpc.net/problem/6996

6996번: 애너그램

 

문제 풀이

 

	private boolean solveAnagrams(String first, String second) {
		if (first.length() != second.length()) return false;
		int alphabet[] = new int[26];
		for (char c : first.toCharArray())
			alphabet[c - 'a']++;
		for (char c : second.toCharArray()) {
			alphabet[c - 'a']--;
			if (alphabet[c - 'a'] < 0) return false;
		}
		return true;
	}

 

다른 풀이 참고

	private boolean solveAnagrams(String first, String second) {
		if (first.length() != second.length()) return false;
		char[] c1 = first.toCharArray(), c2 = second.toCharArray();
		Arrays.sort(c1);
		Arrays.sort(c2);
		return Arrays.equals(c1, c2);
	}