C code. C code run. Run code run… please!
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1514 Question Name: Power Question Description: Give a double and an integer, without using the math library, compute the base to the power of exponent. Input: may contains multiple test cases. The first line indicates how many … Read More »
Question Name: Simulate Stack With Two Queues
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 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 | /** * Filename : StackWithTwoQueues.java * Dependency: None * Author : Sheng Yu (codesays.com) * Create at : 2014-08-03 * JDK used : 1.7 * Change log: None */ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.StreamTokenizer; import java.util.NoSuchElementException; import java.util.Queue; import java.util.concurrent.LinkedBlockingQueue; /** * @author Sheng Yu (codesays.com) * @param <T>: the type of dealing data. */ class Stack<T> { // main queue always stores the elements. // swap is used in pop() function to hold the elements temporarily. private Queue<T> main = new LinkedBlockingQueue<T>(); private Queue<T> swap = new LinkedBlockingQueue<T>(); // Used in pop() function to exchange he main and swap queues. private Queue<T> temp = null; /** * @param item: to push into the stack. */ public void push(T item) { main.add(item); } /** * @return T: remove and return the most recent element in the stack. * @throws NoSuchElementException: pop when queue is empty. */ public T pop() throws NoSuchElementException { T result = null; // swap is always empty at the beginning of popping. if (main.size() == 0) { throw new NoSuchElementException("Queue is empty"); } // Move all data in main queue to swap, except the most recent one. while (main.size() > 1) { swap.add(main.remove()); } // Get the most recent element. result = main.remove(); // Exchange main and swap queue, so that we always push new data into // main queue. temp = main; main = swap; swap = temp; return result; } } public class StackWithTwoQueues { /** * Stub for test * @param args * @throws IOException * @throws NoSuchElementException * @throws IllegalArgumentException */ public static void main(String[] args) throws IOException, NoSuchElementException, IllegalArgumentException { StreamTokenizer st = new StreamTokenizer(new BufferedReader( new InputStreamReader(System.in))); Stack<Integer> test = new Stack<Integer>(); boolean popSuc = true; Integer res = 0; String instruction = null; while (st.nextToken() != StreamTokenizer.TT_EOF) { instruction = st.sval; if (instruction.equalsIgnoreCase("POP")) { try{ popSuc = true; res = test.pop(); } catch (NoSuchElementException e) { // Failed to pop something. popSuc = false; System.out.println(-1); } if (popSuc) { // Successful to pop something. System.out.println(res); } } else if (instruction.equalsIgnoreCase("PUSH")){ st.nextToken(); test.push((int)st.nval); } else { throw new IllegalArgumentException(instruction + "is invalid."); } } } } |
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1513 Question Name: Number Of One In Binary Question Description: Give an integer, check how many 1(s) are there in its binary form. Input: may contains multiple test cases. The first line indicates how many test cases are … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1387 Question Name: Fibonacci Question Description: find the Fibonacci number F(N). Input: may contains multiple test cases. Each case is a single line, including one integer as the N. Output: the Fibonacci number F(N).
1 2 3 4 | Input: 3 Output: 2 |
The solution … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1386 Question Name: Min Number In Rotated Array Question Description: the input array is sorted and then rotated. Write a function to find the minimum value in the array. Input: may contains multiple test cases. For each … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1512 Question Name: Queue With Two Stacks Question Description: simulate a queue class with two stacks. Write a test program for the queue. If queue is empty and pop, print -1. Input: the first list is an … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1385 Question Name: Construct Binary Tree Question Description: With the result of pre-order and in-order traversal of a tree, construct the binary tree, and return its post-order traversal result.. Input: may contain multiple test cases. For each … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1511 Question Name: Print List from End Question Description: giving a single-linked list, print the values of its nodes from end to beginning. Input: multiple lines. Each line is an integer. -1 means reaching the end of … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1510 Question Name: Expand Spaces Question Description: giving a string, expand all spaces into “%20”. Input: a single line as the original string. Output: the expanded string. Example:
1 2 | Input: We Are Happy Output: We%20Are%20Happy |
It is completely the same as the problem … Read More »
Question (in Chinese): http://ac.jobdu.com/problem.php?pid=1384 Question Name: Find an Integer in 2D Array Question Description: in a 2D array, independently every row/column is already sorted in ascending order. Given a such 2D array and an integer, write a function to check … Read More »