isPalindrome

isPalindrome

// returns whether or not a given int passed in is a palindrome
public boolean isPalindrome(Queue<Integer> q) {
    Stack<Integer> s = new Stack<Integer>();
    boolean isPalindrome = true;
    int qSize = q.size();
    for (int i = 0; i < qSize; i++) {
        s.push(q.peek());
        q.add(q.remove());
    }
    while (!s.isEmpty()) {
        int temp = q.peek();
        q.add(q.remove());
        if (s.pop() != temp) {
            isPalindrome = false;
        }
    }
    return isPalindrome;
}