Skip to content

Create Felix.md #1

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

Merged
merged 1 commit into from
Nov 25, 2018
Merged

Create Felix.md #1

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
30 changes: 30 additions & 0 deletions 2019.11.24/Felix.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
import java.util.Arrays;

/**
* @author Felix
* @date 2018年11月2日下午7:27:55
@version 给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。
返回这三个数的和。假定每组输入只存在唯一答案。例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.
与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
*/
public class ThreeSumClosest {
public int threeSumClosest(int[] nums,int target){
int res = nums[0] + nums[1] +nums[nums.length-1];
Arrays.sort(nums);//将数组排序
for(int first=0; first<nums.length-2; first++){//从0开始固定第一个数，第二三个数分别为剩下的边界
int second = first+1,third = nums.length-1;
while(second < third){
int sum = nums[first] + nums[second] + nums[third];
if(sum < target){//数组已经从小到大排序，若sum<target，则第二个数向右走，相当于让sum值变大，更接近target
second++;
}else if(sum > target){//若小于则第三个数向左走，相当于让sum值变小，更接近target
third--;
}else{//相等则最接近target，直接返回
return sum;
}
res = Math.abs(sum-target)<Math.abs(res-target) ? sum : res;
}
}
return res;
}
}