Modify the exception handling in Java and Python.

codes/java/chapter_heap/my_heap.java

@@ -90,7 +90,7 @@ class MaxHeap {
     public int pop() {
         // 判空处理
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         // 交换根节点与最右叶节点（即交换首元素与尾元素）
         swap(0, size() - 1);
         // 删除节点

codes/java/chapter_stack_and_queue/array_deque.java

@@ -89,14 +89,14 @@ class ArrayDeque {
     /* 访问队首元素 */
     public int peekFirst() {
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return nums[front];
     }
 
     /* 访问队尾元素 */
     public int peekLast() {
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         // 计算尾元素索引
         int last = index(front + queSize - 1);
         return nums[last];

codes/java/chapter_stack_and_queue/array_queue.java

@@ -60,7 +60,7 @@ class ArrayQueue {
     /* 访问队首元素 */
     public int peek() {
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return nums[front];
     }
 

codes/java/chapter_stack_and_queue/array_stack.java

@@ -35,14 +35,14 @@ class ArrayStack {
     /* 出栈 */
     public int pop() {
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return stack.remove(size() - 1);
     }
 
     /* 访问栈顶元素 */
     public int peek() {
         if (isEmpty())
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return stack.get(size() - 1);
     }
 

codes/java/chapter_stack_and_queue/linkedlist_queue.java

@@ -56,7 +56,7 @@ class LinkedListQueue {
     /* 访问队首元素 */
     public int peek() {
         if (size() == 0)
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return front.val;
     }
 

codes/java/chapter_stack_and_queue/linkedlist_stack.java

@@ -47,7 +47,7 @@ class LinkedListStack {
     /* 访问栈顶元素 */
     public int peek() {
         if (size() == 0)
-            throw new EmptyStackException();
+            throw new IndexOutOfBoundsException();
         return stackPeek.val;
     }