LeetCode题目集1
需积分: 0 55 浏览量
2022-08-08
21:06:33
上传
评论
收藏 1.76MB DOCX 举报
1.Two Sum(easy)
Given an array of integers, return indices of the two numbers such that they add up to a
specific target.
You may assume that each input would have exactly one solution, and you may not use
the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
输入：
[3,2,4]
6
输出：
[1,2]
2. Add Two Numbers(medium)
Medium
65061693FavoriteShare
You are given two non-empty linked lists representing two non-negative integers. The
digits are stored in reverse order and each of their nodes contain a single digit. Add the
two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0
itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
剩余323页未读，继续阅读
资源评论
