ans;
- for (int& x : nums)
- if (x < pivot) ans.push_back(x);
- for (int& x : nums)
- if (x == pivot) ans.push_back(x);
- for (int& x : nums)
- if (x > pivot) ans.push_back(x);
+ for (int& x : nums) {
+ if (x < pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x == pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x > pivot) {
+ ans.push_back(x);
+ }
+ }
return ans;
}
};
@@ -162,6 +175,29 @@ func pivotArray(nums []int, pivot int) []int {
}
```
+#### TypeScript
+
+```ts
+function pivotArray(nums: number[], pivot: number): number[] {
+ const ans: number[] = [];
+ for (const x of nums) {
+ if (x < pivot) {
+ ans.push(x);
+ }
+ }
+ if (x === pivot) {
+ ans.push(x);
+ }
+ }
+ for (const x of nums) {
+ if (x > pivot) {
+ ans.push(x);
+ }
+ }
+ return ans;
+}
+```
+
diff --git a/solution/2100-2199/2161.Partition Array According to Given Pivot/README_EN.md b/solution/2100-2199/2161.Partition Array According to Given Pivot/README_EN.md
index 3820f0cc07b51..f5c884470e37a 100644
--- a/solution/2100-2199/2161.Partition Array According to Given Pivot/README_EN.md
+++ b/solution/2100-2199/2161.Partition Array According to Given Pivot/README_EN.md
@@ -40,7 +40,7 @@ tags:
Input: nums = [9,12,5,10,14,3,10], pivot = 10
Output: [9,5,3,10,10,12,14]
-Explanation:
+Explanation:
The elements 9, 5, and 3 are less than the pivot so they are on the left side of the array.
The elements 12 and 14 are greater than the pivot so they are on the right side of the array.
The relative ordering of the elements less than and greater than pivot is also maintained. [9, 5, 3] and [12, 14] are the respective orderings.
@@ -51,7 +51,7 @@ The relative ordering of the elements less than and greater than pivot is also m
Input: nums = [-3,4,3,2], pivot = 2
Output: [-3,2,4,3]
-Explanation:
+Explanation:
The element -3 is less than the pivot so it is on the left side of the array.
The elements 4 and 3 are greater than the pivot so they are on the right side of the array.
The relative ordering of the elements less than and greater than pivot is also maintained. [-3] and [4, 3] are the respective orderings.
@@ -72,7 +72,11 @@ The relative ordering of the elements less than and greater than pivot is also m
-### Solution 1
+### Solution 1: Simulation
+
+We can traverse the array $\textit{nums}$, sequentially finding all elements less than $\textit{pivot}$, all elements equal to $\textit{pivot}$, and all elements greater than $\textit{pivot}$, then concatenate them in the order required by the problem.
+
+Time complexity $O(n)$, where $n$ is the length of the array $\textit{nums}$. Ignoring the space consumption of the answer array, the space complexity is $O(1)$.
@@ -127,12 +131,21 @@ class Solution {
public:
vector pivotArray(vector& nums, int pivot) {
vector ans;
- for (int& x : nums)
- if (x < pivot) ans.push_back(x);
- for (int& x : nums)
- if (x == pivot) ans.push_back(x);
- for (int& x : nums)
- if (x > pivot) ans.push_back(x);
+ for (int& x : nums) {
+ if (x < pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x == pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x > pivot) {
+ ans.push_back(x);
+ }
+ }
return ans;
}
};
@@ -162,6 +175,30 @@ func pivotArray(nums []int, pivot int) []int {
}
```
+#### TypeScript
+
+```ts
+function pivotArray(nums: number[], pivot: number): number[] {
+ const ans: number[] = [];
+ for (const x of nums) {
+ if (x < pivot) {
+ ans.push(x);
+ }
+ }
+ for (const x of nums) {
+ if (x === pivot) {
+ ans.push(x);
+ }
+ }
+ for (const x of nums) {
+ if (x > pivot) {
+ ans.push(x);
+ }
+ }
+ return ans;
+}
+```
+
diff --git a/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.cpp b/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.cpp
index 227e94ca4f10d..23954763468f2 100644
--- a/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.cpp
+++ b/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.cpp
@@ -2,12 +2,21 @@ class Solution {
public:
vector pivotArray(vector& nums, int pivot) {
vector ans;
- for (int& x : nums)
- if (x < pivot) ans.push_back(x);
- for (int& x : nums)
- if (x == pivot) ans.push_back(x);
- for (int& x : nums)
- if (x > pivot) ans.push_back(x);
+ for (int& x : nums) {
+ if (x < pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x == pivot) {
+ ans.push_back(x);
+ }
+ }
+ for (int& x : nums) {
+ if (x > pivot) {
+ ans.push_back(x);
+ }
+ }
return ans;
}
-};
\ No newline at end of file
+};
diff --git a/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.ts b/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.ts
new file mode 100644
index 0000000000000..c12186e187150
--- /dev/null
+++ b/solution/2100-2199/2161.Partition Array According to Given Pivot/Solution.ts
@@ -0,0 +1,19 @@
+function pivotArray(nums: number[], pivot: number): number[] {
+ const ans: number[] = [];
+ for (const x of nums) {
+ if (x < pivot) {
+ ans.push(x);
+ }
+ }
+ for (const x of nums) {
+ if (x === pivot) {
+ ans.push(x);
+ }
+ }
+ for (const x of nums) {
+ if (x > pivot) {
+ ans.push(x);
+ }
+ }
+ return ans;
+}