【LeetCode】977. Squares of a Sorted Array
2019-04-09 00:43
113 查看
原题网址:https://leetcode.com/problems/squares-of-a-sorted-array/
解题思路:
我的解:毫无疑问的暴力解。。。。
[code] public int[] sortedSquares(int[] A) { int len = A.length; int[] B = new int[len]; for(int i = 0; i < len; i++){ B[i] = A[i] * A[i]; } for(int i = 0; i < len; i++){ for(int j = 1; j < len - i; j++){ if(B[j-1] > B[j]){ int temp; temp = B[j-1]; B[j-1] = B[j]; B[j] = temp; } } } return B; }
最优解:
[code] public int[] sortedSquares(int[] A) { int n = A.length; int[] result = new int ; int i = 0, j = n - 1; for (int p = n - 1; p >= 0; p--) { if (Math.abs(A[i]) > Math.abs(A[j])) {//首先要能够考虑到abs函数 result[p] 1.首先要能够考虑到abs函数= A[i] * A[i]; i++; } else { result[p] = A[j] * A[j]; j--; } } return result; }
public static double abs(double a)
2.最大值一定是从最左或者最右的值产生;
3.分别设置最左最右索引i和j,不断缩小范围。(这个想法实在是高啊,佩服佩服~)
相关文章推荐
- Leetcode 977. Squares of a Sorted Array
- Leetcode: Search in Rotated Sorted Array II
- 【LeetCode】Search in Rotated Sorted Array
- LeetCode Find Minimum in Rotated Sorted Array
- <easy>LeetCode Problem -- 167. Two Sum II - Input array is sorted
- 【leetcode】Remove Duplicates from Sorted Array
- Search in Rotated Sorted Array II(leetcode)
- leetcode 167[easy]---Two Sum II - Input array is sorted
- Leetcode|Convert Sorted Array to Binary Search Tree
- [LeetCode] Remove Duplicates from Sorted Array II
- [LeetCode]Remove Duplicates from Sorted Array
- [LeetCode] Search in Rotated Sorted Array II [36]
- LeetCode Remove Duplicates from Sorted Array II
- [leetcode]33. Search in Rotated Sorted Array(Java实现)
- Java for LeetCode 080 Remove Duplicates from Sorted Array II
- LeetCode88 Merge Sorted Array
- Remove Duplicates from Sorted Array [LeetCode]
- LeetCode | 167. Two Sum II - Input array is sorted
- 【leetcode】33. Search in Rotated Sorted Array【java】
- LeetCode 33. Search in Rotated Sorted Array