1.ArrayPartition数组划分:
给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ,使得从1 到 n 的 min(ai, bi) 总和最大。
2.TwoSum两数之和:
给定一个整数数组和一个目标值,找出数组中和为目标值的两个数。你可以假设每个输入只对应一种答案,且同样的元素不能被重复利用。
-
Notifications
You must be signed in to change notification settings - Fork 0
fabaogege/LeetCode
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
LeetCode学习笔记(含剑指offer笔记)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published