algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' of github.com:youngyangyang04/leetcode-master

Browse Source
This commit is contained in:
programmercarl
2023-02-13 11:28:39 +08:00
parent 78afbd2412 2dc18873f5
commit b0c67e3dff
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0977.有序数组的平方.md
View File

@ -183,14 +183,14 @@ Rust
impl Solution { impl Solution {
pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> { pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
let n = nums.len(); let n = nums.len();
let (mut i,mut j,mut k) = (0,n - 1,n- 1); let (mut i,mut j,mut k) = (0,n - 1,n);
let mut ans = vec![0;n]; let mut ans = vec![0;n];
while i <= j{ while i <= j{
if nums[i] * nums[i] < nums[j] * nums[j] { if nums[i] * nums[i] < nums[j] * nums[j] {
ans[k] = nums[j] * nums[j]; ans[k-1] = nums[j] * nums[j];
j -= 1; j -= 1;
}else{ }else{
ans[k] = nums[i] * nums[i]; ans[k-1] = nums[i] * nums[i];
i += 1; i += 1;
} }
k -= 1; k -= 1;