Skip to content

Modify semantic to make it closer to LeetCode #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
paulyin2001 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Modify semantic to make it closer to LeetCode #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 9 additions & 3 deletions docs/算法指南/面试流程.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,8 @@ sidebar_position: 62
无论这道题对你来说是简单还是难，**每道算法题都需要按照以下模版输出文档：**

- Questions:（边听问题边记录关键点，确保正确理解题目，不需要注重文法严谨性）
- Input:（题目输入的范围以及限制）
- Input:（题目输入）
- Constraints: (输入的范围以及限制)
- Output:（输出的范围以及限制）
- Requirement: (optional) (题目特殊的时空复杂度要求）
- Test case: （根据输入类型选择几个测试用例）
Expand All @@ -31,8 +32,13 @@ sidebar_position: 62
exactly one solution

Input:
1 ≤ array.length < 10^6
0 ≤ array[i] < 10^8
array: array of integers
T: an integer

Constraints:
2 <= array.length < 10^4
-10^9 <= array[i] < 10^9
-10^9 <= T <= 10^9

Output:
[i, j]
Expand Down