LeetCode算法入门- 3Sum Closest -day10
LeetCode算法入门- 3Sum Closest -day10
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
解法思路：记得利用左边和右边两个指针进行遍历，会更快一些
代码如下：
class Solution {public int threeSumClosest(int[] nums, int target) {int len = nums.length;int min = Integer.MAX_VALUE;int result = 0;//记得先排好序Arrays.sort(nums);for(int i = 0; i < len; i++){//利用left和right两个指针int left = i + 1;int right = len - 1;while(left < right){int sum = nums[i] + nums[left] + nums[right];int diff = Math.abs(sum - target);if(diff < min){//用一个min值来保存差距最小的值，记得保存住此时的3sum值是多少min = diff;result = sum;}if(sum >= target)right--;elseleft++;}}return result;}
}
LeetCode算法入门- 3Sum Closest -day10相关推荐
- LeetCode算法入门- 3Sum -day9
LeetCode算法入门- 3Sum -day9 题目描述: Given an array nums of n integers, are there elements a, b, c in nums ...
- LeetCode算法入门- Implement strStr() -day22
LeetCode算法入门- Implement strStr() -day22 题目描述 Implement strStr(). Return the index of the first occur ...
- LeetCode算法入门- Remove Duplicates from Sorted Array -day21
LeetCode算法入门- Remove Duplicates from Sorted Array -day21 题目描述 Given a sorted array nums, remove the ...
- LeetCode算法入门- Remove Element -day20
LeetCode算法入门- Remove Element -day20 1. 题目描述 Given an array nums and a value val, remove all instance ...
- LeetCode算法入门- Search Insert Position -day19
LeetCode算法入门- Search Insert Position -day19 题目描述 Given a sorted array and a target value, return the ...
- LeetCode算法入门- Multiply Strings -day18
LeetCode算法入门- Multiply Strings -day18 题目介绍 Given two non-negative integers num1 and num2 represented ...
- LeetCode算法入门- Remove Nth Node From End of List -day17
LeetCode算法入门- Remove Nth Node From End of List -day17 题目解释: Given a linked list, remove the n-th nod ...
- LeetCode算法入门- Generate Parentheses -day16
LeetCode算法入门- Generate Parentheses -day16 题目描述 Given n pairs of parentheses, write a function to gen ...
- LeetCode算法入门- Merge Two Sorted Lists -day15
LeetCode算法入门- Merge Two Sorted Lists -day15 题目描述: Merge two sorted linked lists and return it as a n ...
最新文章
- Sql Server2005 Transact-SQL 新兵器学习总结之-数据类型
- [WebApp]定宽网页设计下，固定宽度布局开发WebApp并实现多终端下WebApp布局自适应...
- python中类方法与实例方法的区别-python中类方法，实例方法，静态方法的作用和区别...
- 6.2 二叉树的定义、性质与存储结构
- mysql 在线备份脚本,MySQL备份脚本
- diskData磁盘数据分析
- idea中未被识别的maven项目，如何手动添加
- Luogu3403跳楼机
- html5鼠标悬停遮罩,js实现鼠标移动到图片产生遮罩效果
- 再谈mysql数据库之索引，联合索引，覆盖索引
- 调用MYSQL存储过程实例
- 定积分之几种常见曲线
- java代码到opcode_OPcode简介
- 计算机储存容量单位的进率,进制、存储与容量
- RestTemplate使用实战-exchange方法讲解-HTTP请求
- Citrix ADC 13.0 下载 百度网盘 按您的方式进行应用交付
- 今日头条2017校招笔试题
- jnz和djnz_djnz(单片机djnz指令的功能)
- 文献阅读——How to give an Academic Talk
- k图着色 遗传算法的简单python伪代码