Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 6f14f9b

Browse files
feat: add solutions to lc problem: No.1968 (doocs#3548)
No.1968.Array With Elements Not Equal to Average of Neighbors
1 parent 1705e6b commit 6f14f9b

File tree

7 files changed

+75
-84
lines changed

7 files changed

+75
-84
lines changed

‎solution/1900-1999/1968.Array With Elements Not Equal to Average of Neighbors/README.md‎

Lines changed: 26 additions & 31 deletions
Original file line numberDiff line numberDiff line change
@@ -65,6 +65,10 @@ i=3, nums[i] = 2, 两相邻元素平均值为 (6+0) / 2 = 3
6565

6666
### 方法一:排序
6767

68+
由于数组中的元素是互不相同的,我们可以先对数组进行排序,然后将数组分成两部分,将前一半的元素放到答案数组中的偶数位置,将后一半的元素放到答案数组中的奇数位置。这样,对于每个元素,它的两个相邻元素都不会等于它的平均值。
69+
70+
时间复杂度 $O(n \times \log n),ドル空间复杂度 $O(n)$。其中 $n$ 是数组 $\textit{nums}$ 的长度。
71+
6872
<!-- tabs:start -->
6973

7074
#### Python3
@@ -74,7 +78,7 @@ class Solution:
7478
def rearrangeArray(self, nums: List[int]) -> List[int]:
7579
nums.sort()
7680
n = len(nums)
77-
m = (n + 1) >>1
81+
m = (n + 1) //2
7882
ans = []
7983
for i in range(m):
8084
ans.append(nums[i])
@@ -109,13 +113,15 @@ class Solution {
109113
class Solution {
110114
public:
111115
vector<int> rearrangeArray(vector<int>& nums) {
112-
sort(nums.begin(), nums.end());
116+
ranges::sort(nums);
113117
vector<int> ans;
114118
int n = nums.size();
115119
int m = (n + 1) >> 1;
116120
for (int i = 0; i < m; ++i) {
117121
ans.push_back(nums[i]);
118-
if (i + m < n) ans.push_back(nums[i + m]);
122+
if (i + m < n) {
123+
ans.push_back(nums[i + m]);
124+
}
119125
}
120126
return ans;
121127
}
@@ -125,46 +131,35 @@ public:
125131
#### Go
126132
127133
```go
128-
func rearrangeArray(nums []int) []int {
134+
func rearrangeArray(nums []int) (ans []int) {
129135
sort.Ints(nums)
130136
n := len(nums)
131137
m := (n + 1) >> 1
132-
var ans []int
133138
for i := 0; i < m; i++ {
134139
ans = append(ans, nums[i])
135140
if i+m < n {
136141
ans = append(ans, nums[i+m])
137142
}
138143
}
139-
return ans
144+
return
140145
}
141146
```
142147

143-
<!-- tabs:end -->
144-
145-
<!-- solution:end -->
146-
147-
<!-- solution:start -->
148-
149-
### 方法二:随机打乱
150-
151-
<!-- tabs:start -->
152-
153-
#### Go
154-
155-
```go
156-
func rearrangeArray(nums []int) []int {
157-
rand.Seed(time.Now().UnixNano())
158-
outer:
159-
for {
160-
rand.Shuffle(len(nums), func(i, j int) { nums[i], nums[j] = nums[j], nums[i] })
161-
for i := 1; i < len(nums)-1; i++ {
162-
if nums[i]*2 == nums[i-1]+nums[i+1] {
163-
continue outer
164-
}
165-
}
166-
return nums
167-
}
148+
#### TypeScript
149+
150+
```ts
151+
function rearrangeArray(nums: number[]): number[] {
152+
nums.sort((a, b) => a - b);
153+
const n = nums.length;
154+
const m = (n + 1) >> 1;
155+
const ans: number[] = [];
156+
for (let i = 0; i < m; i++) {
157+
ans.push(nums[i]);
158+
if (i + m < n) {
159+
ans.push(nums[i + m]);
160+
}
161+
}
162+
return ans;
168163
}
169164
```
170165

‎solution/1900-1999/1968.Array With Elements Not Equal to Average of Neighbors/README_EN.md‎

Lines changed: 27 additions & 32 deletions
Original file line numberDiff line numberDiff line change
@@ -63,7 +63,11 @@ When i=3, nums[i] = 2, and the average of its neighbors is (6+0) / 2 = 3.
6363

6464
<!-- solution:start -->
6565

66-
### Solution 1
66+
### Solution 1: Sorting
67+
68+
Since the elements in the array are distinct, we can first sort the array, then divide the array into two parts. Place the first half of the elements in the even positions of the answer array, and the second half of the elements in the odd positions of the answer array. In this way, for each element, its two adjacent elements will not be equal to its average value.
69+
70+
The time complexity is $O(n \times \log n),ドル and the space complexity is $O(n)$. Here, $n$ is the length of the array $\textit{nums}$.
6771

6872
<!-- tabs:start -->
6973

@@ -74,7 +78,7 @@ class Solution:
7478
def rearrangeArray(self, nums: List[int]) -> List[int]:
7579
nums.sort()
7680
n = len(nums)
77-
m = (n + 1) >>1
81+
m = (n + 1) //2
7882
ans = []
7983
for i in range(m):
8084
ans.append(nums[i])
@@ -109,13 +113,15 @@ class Solution {
109113
class Solution {
110114
public:
111115
vector<int> rearrangeArray(vector<int>& nums) {
112-
sort(nums.begin(), nums.end());
116+
ranges::sort(nums);
113117
vector<int> ans;
114118
int n = nums.size();
115119
int m = (n + 1) >> 1;
116120
for (int i = 0; i < m; ++i) {
117121
ans.push_back(nums[i]);
118-
if (i + m < n) ans.push_back(nums[i + m]);
122+
if (i + m < n) {
123+
ans.push_back(nums[i + m]);
124+
}
119125
}
120126
return ans;
121127
}
@@ -125,46 +131,35 @@ public:
125131
#### Go
126132
127133
```go
128-
func rearrangeArray(nums []int) []int {
134+
func rearrangeArray(nums []int) (ans []int) {
129135
sort.Ints(nums)
130136
n := len(nums)
131137
m := (n + 1) >> 1
132-
var ans []int
133138
for i := 0; i < m; i++ {
134139
ans = append(ans, nums[i])
135140
if i+m < n {
136141
ans = append(ans, nums[i+m])
137142
}
138143
}
139-
return ans
144+
return
140145
}
141146
```
142147

143-
<!-- tabs:end -->
144-
145-
<!-- solution:end -->
146-
147-
<!-- solution:start -->
148-
149-
### Solution 2
150-
151-
<!-- tabs:start -->
152-
153-
#### Go
154-
155-
```go
156-
func rearrangeArray(nums []int) []int {
157-
rand.Seed(time.Now().UnixNano())
158-
outer:
159-
for {
160-
rand.Shuffle(len(nums), func(i, j int) { nums[i], nums[j] = nums[j], nums[i] })
161-
for i := 1; i < len(nums)-1; i++ {
162-
if nums[i]*2 == nums[i-1]+nums[i+1] {
163-
continue outer
164-
}
165-
}
166-
return nums
167-
}
148+
#### TypeScript
149+
150+
```ts
151+
function rearrangeArray(nums: number[]): number[] {
152+
nums.sort((a, b) => a - b);
153+
const n = nums.length;
154+
const m = (n + 1) >> 1;
155+
const ans: number[] = [];
156+
for (let i = 0; i < m; i++) {
157+
ans.push(nums[i]);
158+
if (i + m < n) {
159+
ans.push(nums[i + m]);
160+
}
161+
}
162+
return ans;
168163
}
169164
```
170165

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,16 @@
11
class Solution {
22
public:
33
vector<int> rearrangeArray(vector<int>& nums) {
4-
sort(nums.begin(), nums.end());
4+
ranges::sort(nums);
55
vector<int> ans;
66
int n = nums.size();
77
int m = (n + 1) >> 1;
88
for (int i = 0; i < m; ++i) {
99
ans.push_back(nums[i]);
10-
if (i + m < n) ans.push_back(nums[i + m]);
10+
if (i + m < n) {
11+
ans.push_back(nums[i + m]);
12+
}
1113
}
1214
return ans;
1315
}
14-
};
16+
};
Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,12 @@
1-
func rearrangeArray(nums []int) []int {
1+
func rearrangeArray(nums []int) (ans[]int) {
22
sort.Ints(nums)
33
n := len(nums)
44
m := (n + 1) >> 1
5-
var ans []int
65
for i := 0; i < m; i++ {
76
ans = append(ans, nums[i])
87
if i+m < n {
98
ans = append(ans, nums[i+m])
109
}
1110
}
12-
returnans
13-
}
11+
return
12+
}

‎solution/1900-1999/1968.Array With Elements Not Equal to Average of Neighbors/Solution.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ class Solution:
22
def rearrangeArray(self, nums: List[int]) -> List[int]:
33
nums.sort()
44
n = len(nums)
5-
m = (n + 1) >>1
5+
m = (n + 1) //2
66
ans = []
77
for i in range(m):
88
ans.append(nums[i])
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
function rearrangeArray(nums: number[]): number[] {
2+
nums.sort((a, b) => a - b);
3+
const n = nums.length;
4+
const m = (n + 1) >> 1;
5+
const ans: number[] = [];
6+
for (let i = 0; i < m; i++) {
7+
ans.push(nums[i]);
8+
if (i + m < n) {
9+
ans.push(nums[i + m]);
10+
}
11+
}
12+
return ans;
13+
}

‎solution/1900-1999/1968.Array With Elements Not Equal to Average of Neighbors/Solution2.go‎

Lines changed: 0 additions & 13 deletions
This file was deleted.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /