leetcode-624. Maximum Distance in Arrays
2017-06-18 11:49
483 查看
考察点:数组,比较大小;
思路:很简单,找出最大和次大的数,找出最小和次小的数,如果最大最小的数的脚码不同,就直接算绝对值,否则,把次大次小加进去计算最大绝对值。(我的代码很丑,以后不能用数组存储值和脚码,应该善用struct)
C++代码:
思路:很简单,找出最大和次大的数,找出最小和次小的数,如果最大最小的数的脚码不同,就直接算绝对值,否则,把次大次小加进去计算最大绝对值。(我的代码很丑,以后不能用数组存储值和脚码,应该善用struct)
C++代码:
class Solution { public: int abs(int a, int b) { return a>b?(a-b):(b-a); } int maxDistance(vector<vector<int>>& arrays) { int len = arrays.size(); int num[len][2]; for (int i=0; i<len; i++) { num[i][0] = arrays[i][0]; num[i][1] = arrays[i][arrays[i].size()-1]; } int min1[2][2],max1[2][2]; min1[0][0] = INT_MAX; min1[0][1] = -1; min1[1][0] = INT_MAX; min1[1][1] = -1; max1[0][0] = INT_MIN; max1[0][1] = -1; max1[1][0] = INT_MIN; max1[1][1] = -1; for (int i=0; i<len; i++) { if (num[i][0] < min1[1][0]) { min1[1][0] = num[i][0]; min1[1][1] = i; if (min1[0][0] > min1[1][0]) { swap(min1[0][0],min1[1][0]); swap(min1[0][1],min1[1][1]); } } if (num[i][1] > max1[1][0]) { max1[1][0] = num[i][1]; max1[1][1] = i; if (max1[0][0] < max1[1][0]) { swap(max1[0][0],max1[1][0]); swap(max1[0][1],max1[1][1]); } } } if (max1[0][1] != min1[0][1]) { //cout<<"?"<<endl; return max1[0][0] - min1[0][0]; } else { int temp = max1[0][0] - min1[1][0]; int temp2 = max1[1][0] - min1[0][0]; return temp>temp2?temp:temp2; } } };
相关文章推荐
- [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 (在数组中的最大距离)$
- Python 刷题日记:LeetCode 624. Maximum Distance in Arrays
- Leetcode 624 Maximum Distance in Arrays
- LeetCode Maximum Distance in Arrays
- [LeetCode] 624.Maximum Distance in Arrays
- LeetCode解题思路之Maximum Distance in Arrays
- LeetCode-624:Maximum Distance in Arrays (多数组找元素最大距离)
- [LeetCode] Maximum Distance in Arrays 数组中的最大距离
- leetcode624: Maximum Distance in Arrays
- LeetCode-Find Minimum in Rotated Sorted Arrays
- Maximum Distance in Arrays
- Maximum Distance in Arrays (第十七周 数组)
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- 624.Maximum Distance in Arrays --找数组中的最大差值
- LeetCode Search in Rotated Sorted Arrays ||
- Destruction Masking in Frostbite 2 using Volume Distance Fields