leetcode.cn 2026-06-08
🟡2161.partition-array-according-to-given-pivot
🏷️ Tags
#array #two_pointers #simulation
🟡2161.partition-array-according-to-given-pivot
🏷️ Tags
#array #two_pointers #simulation
Telegraph
partition-array-according-to-given-pivot
给你一个下标从 0 开始的整数数组 nums 和一个整数 pivot 。请你将 nums 重新排列,使得以下条件均成立:
leetcode.com 2026-06-08
🟡2161.partition-array-according-to-given-pivot
🏷️ Tags
#array #two_pointers #simulation
🟡2161.partition-array-according-to-given-pivot
🏷️ Tags
#array #two_pointers #simulation
Telegraph
partition-array-according-to-given-pivot
You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums such that the following conditions are satisfied:
leetcode.cn 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
给你一个长度为 n 的整数数组 nums。
leetcode.com 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
You are given an integer array nums of length n. Construct an array prefixGcd where for each index i: