forked from JaeYeopHan/algorithm_basic_java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathIsPalindromeTest.java
40 lines (32 loc) · 1.03 KB
/
IsPalindromeTest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package datastructure.stack;
import org.junit.Test;
import java.util.Stack;
import static org.hamcrest.CoreMatchers.is;
import static org.junit.Assert.assertThat;
public class IsPalindromeTest {
/*
TASK
Stack 자료구조를 사용하여 회문을 판별한다.
*/
@Test
public void test() {
assertThat(isPalindrome("abba"), is(true));
assertThat(isPalindrome("dabccbad"), is(true));
assertThat(isPalindrome("abcba"), is(true));
assertThat(isPalindrome("fabccdedccbaf"), is(true));
assertThat(isPalindrome("fabccdedccbf"), is(false));
}
public boolean isPalindrome(String str) {
Stack<Character> stack = new Stack<>();
char[] charArr = str.toCharArray();
for (int i = 0; i < str.length() / 2; i++) {
stack.add(charArr[i]);
}
for (int i = (str.length() + 1)/2; i < str.length(); i++) {
if (stack.pop() != charArr[i]) {
return false;
}
}
return true;
}
}