CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-04-23 14:58:03 +08:00
parent 881ece517f
commit fe8027e64a
26 changed files with 344 additions and 626 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
chapter_stack_and_queue/deque.md
View File

@@ -1067,7 +1067,7 @@ comments: true
typedef struct linkedListDeque linkedListDeque;
/* 构造j */
/* 构造函数 */
linkedListDeque *newLinkedListDeque() {
linkedListDeque *deque = (linkedListDeque *)malloc(sizeof(linkedListDeque));
deque->front = NULL;
@@ -1606,14 +1606,14 @@ comments: true
/* 访问队首元素 */
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];
@@ -1812,12 +1812,14 @@ comments: true
def peek_first(self) -> int:
"""访问队首元素"""
assert not self.is_empty(), "双向队列为空"
if self.is_empty():
raise IndexError("双向队列为空")
return self.__nums[self.__front]
def peek_last(self) -> int:
"""访问队尾元素"""
assert not self.is_empty(), "双向队列为空"
if self.is_empty():
raise IndexError("双向队列为空")
# 计算尾元素索引
last = self.index(self.__front + self.__size - 1)
return self.__nums[last]