github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Format the EN markdown files.

Browse Source
This commit is contained in:
krahets 2024-05-01 07:28:18 +08:00
parent 12fc5e49eb
commit 99ad40ea26
2 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
en/docs/chapter_backtracking/permutations_problem.md
View File

@ -6,7 +6,7 @@ The table below lists several example data, including the input arrays and their
<p align="center"> Table <id> &nbsp; Permutation examples </p>
| Input array | Permutations |
| Input array | Permutations |
| :---------- | :----------------------------------------------------------------- |
| $[1]$ | $[1]$ |
| $[1, 2]$ | $[1, 2], [2, 1]$ |

14
en/docs/chapter_stack_and_queue/deque.md
View File

@ -10,14 +10,14 @@ The common operations in a double-ended queue are listed below, and the names of
<p align="center"> Table <id> &nbsp; Efficiency of double-ended queue operations </p>
| Method Name | Description | Time Complexity |
| ------------- | --------------------------- | --------------- |
| Method Name | Description | Time Complexity |
| ------------- | -------------------------- | --------------- |
| `pushFirst()` | Add an element to the head | $O(1)$ |
| `pushLast()` | Add an element to the tail | $O(1)$ |
| `popFirst()` | Remove the first element | $O(1)$ |
| `popLast()` | Remove the last element | $O(1)$ |
| `peekFirst()` | Access the first element | $O(1)$ |
| `peekLast()` | Access the last element | $O(1)$ |
| `pushLast()` | Add an element to the tail | $O(1)$ |
| `popFirst()` | Remove the first element | $O(1)$ |
| `popLast()` | Remove the last element | $O(1)$ |
| `peekFirst()` | Access the first element | $O(1)$ |
| `peekLast()` | Access the last element | $O(1)$ |
Similarly, we can directly use the double-ended queue classes implemented in programming languages: