624. Maximum Distance in Arrays 数组最大距离
来源:互联网 发布:centos更新火狐浏览器 编辑:程序博客网 时间:2024/06/16 10:40
Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers a and b to be their absolute difference |a-b|. Your task is to find the maximum distance.
给定m个数组,均为升序。可于两个数组中各取一个数来计算其距离,这里距离被定义为两数差的绝对值。算法要求返回最大的距离。
Example 1:
Input: [[1,2,3], [4,5], [1,2,3]]Output: 4Explanation: One way to reach the maximum distance 4 is to pick 1 in the first or third array and pick 5 in the second array.
Note:
1. Each given array will have at least 1 number. There will be at least two non-empty arrays.
2. The total number of the integers in all the m arrays will be in the range of [2, 10000].
3. The integers in the m arrays will be in the range of [-10000, 10000].
思路
升序排列,开头最小末尾最大,只需扫描数组记录最小左值和最大右值之差,并确保不在同一行即可。
class Solution {public: int maxDistance(vector<vector<int>>& arrays) { int left = arrays[0][0], right = arrays[0].back(), ans = 0; for(int i = 1; i < arrays.size(); i++){ ans = max(ans, max(abs(arrays[i][0] - right), abs(arrays[i].back() - left))); left = min(left, arrays[i][0]); right = max(right, arrays[i].back()); } return ans; }};
阅读全文
0 0
- 624. Maximum Distance in Arrays 数组最大距离
- 624.Maximum Distance in Arrays --找数组中的最大差值
- LeetCode-624:Maximum Distance in Arrays (多数组找元素最大距离)
- leetcode-624. Maximum Distance in Arrays
- [leetcode]: 624. Maximum Distance in Arrays
- [LeetCode]624. Maximum Distance in Arrays
- [LeetCode]624. Maximum Distance in Arrays
- [LeetCode] 624.Maximum Distance in Arrays
- leetcode624: Maximum Distance in Arrays
- leetcode624. Maximum Distance in Arrays
- Maximum Distance in Arrays (第十七周 数组)
- Python 刷题日记:LeetCode 624. Maximum Distance in Arrays
- Leetcode 624 Maximum Distance in Arrays
- 566. Reshape the Matrix/624. Maximum Distance in Arrays/594. Longest Harmonious Subsequence
- Maximum Subarray [最大子数组]
- JavaScript实现-找出多个数组中的最大数-Return Largest Numbers in Arrays
- FCC算法:六、找出多个数组中的最大数--Return Largest Numbers in Arrays
- 面试:数组:最大下标距离
- 微信小程序外部引入方法
- Java HashMap的工作原理
- PAT乙-1005 继续(3n+1)猜想
- Oracle expdp/impdp导出导入命令及数据库备份(转)
- JAVA容器之-SET
- 624. Maximum Distance in Arrays 数组最大距离
- concurrent-01(线程安全单例模式)
- android 高德地图之poi搜索功能的实现
- 使用expdp和impdp时应该注重的事项:
- TCP 的那些事儿(上)
- lintcode:不同的二叉查找树
- Struts2笔记第二天
- 2504: 蚂蚁感冒
- ubuntu-16.04.2-server 相关