mirror of
https://github.com/massbug/judge4c.git
synced 2025-07-03 07:14:47 +00:00
60 lines
987 B
TypeScript
60 lines
987 B
TypeScript
export const DEFAULT_PROBLEM_DESCRIPTION = `
|
|
|
|
# 1. Two Sum
|
|
|
|
Given an array of integers \`nums\` and an integer \`target\`, return *indices of the two numbers such that they add up to \`target\`*.
|
|
|
|
You may assume that each input would have ***exactly* one solution**, and you may not use the same element twice.
|
|
|
|
You can return the answer in any order.
|
|
|
|
## Examples
|
|
|
|
### Example 1
|
|
|
|
\`\`\`bash
|
|
Input: nums = [2,7,11,15], target = 9
|
|
Output: [0,1]
|
|
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
|
|
\`\`\`
|
|
|
|
### Example 2
|
|
|
|
\`\`\`bash
|
|
Input: nums = [3,2,4], target = 6
|
|
Output: [1,2]
|
|
\`\`\`
|
|
|
|
### Example 3
|
|
|
|
\`\`\`bash
|
|
Input: nums = [3,3], target = 6
|
|
Output: [0,1]
|
|
\`\`\`
|
|
|
|
## Constraints
|
|
|
|
\`\`\`math
|
|
2 <= nums.length <= 10^4
|
|
\`\`\`
|
|
|
|
\`\`\`math
|
|
-10^9 <= nums[i] <= 10^9
|
|
\`\`\`
|
|
|
|
\`\`\`math
|
|
-10^9 <= target <= 10^9
|
|
\`\`\`
|
|
|
|
<div align="center">
|
|
|
|
Only one valid answer exists.
|
|
|
|
</div>
|
|
|
|
---
|
|
|
|
**Follow-up:** Can you come up with an algorithm that is less than $O(n^2)$ time complexity?
|
|
|
|
`;
|