超级会员免费看
该博客讨论了LeetCode中的Two Sum问题，要求在整数数组中找到两个数，使得它们的和等于目标值。提供的解决方案是先对数组排序，然后从两端开始比较，逐步调整索引直至找到合适的一对数。例如，当数组为{2, 7, 11, 15}且目标为9时，返回的解是index1=1, index2=2。"
132969690,10270697,电源恒流充电异常分析：电流为何下降,"['嵌入式硬件', '电源管理', '充电技术']
1.题目
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
订阅专栏 解锁全文
扫一扫
133
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
