Movatterモバイル変換

[0]ホーム
URL:

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

Commita7cb3f7

Browse files
Implement solution for "Split Array with Minimum Difference" in C++, Go, Python, and TypeScript
1 parent8e8e104 commita7cb3f7

File tree

4 files changed

+136
-0
lines changed

4 files changed

+136
-0
lines changed
Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
classSolution {
2+
public:
3+
longlongsplitArray(vector<int>& nums) {
4+
int n = nums.size();
5+
vector<longlong>s(n);
6+
s[0] = nums[0];
7+
vector<bool>f(n,true),g(n,true);
8+
9+
for (int i =1; i < n; ++i) {
10+
s[i] = s[i -1] + nums[i];
11+
f[i] = f[i -1];
12+
if (nums[i] <= nums[i -1]) {
13+
f[i] =false;
14+
}
15+
}
16+
for (int i = n -2; i >=0; --i) {
17+
g[i] = g[i +1];
18+
if (nums[i] <= nums[i +1]) {
19+
g[i] =false;
20+
}
21+
}
22+
23+
constlonglong inf = LLONG_MAX;
24+
longlong ans = inf;
25+
for (int i =0; i < n -1; ++i) {
26+
if (f[i] && g[i +1]) {
27+
longlong s1 = s[i];
28+
longlong s2 = s[n -1] - s[i];
29+
ans =min(ans,llabs(s1 - s2));
30+
}
31+
}
32+
return ans < inf ? ans : -1;
33+
}
34+
};
Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
funcsplitArray(nums []int)int64 {
2+
n:=len(nums)
3+
s:=make([]int64,n)
4+
f:=make([]bool,n)
5+
g:=make([]bool,n)
6+
fori:=rangef {
7+
f[i]=true
8+
g[i]=true
9+
}
10+
11+
s[0]=int64(nums[0])
12+
fori:=1;i<n;i++ {
13+
s[i]=s[i-1]+int64(nums[i])
14+
f[i]=f[i-1]
15+
ifnums[i]<=nums[i-1] {
16+
f[i]=false
17+
}
18+
}
19+
fori:=n-2;i>=0;i-- {
20+
g[i]=g[i+1]
21+
ifnums[i]<=nums[i+1] {
22+
g[i]=false
23+
}
24+
}
25+
26+
constinf=int64(^uint64(0)>>1)
27+
ans:=inf
28+
fori:=0;i<n-1;i++ {
29+
iff[i]&&g[i+1] {
30+
s1:=s[i]
31+
s2:=s[n-1]-s[i]
32+
ans=min(ans,abs(s1-s2))
33+
}
34+
}
35+
ifans<inf {
36+
returnans
37+
}
38+
return-1
39+
}
40+
41+
funcabs(xint64)int64 {
42+
ifx<0 {
43+
return-x
44+
}
45+
returnx
46+
}
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
classSolution:
2+
defsplitArray(self,nums:List[int])->int:
3+
s=list(accumulate(nums))
4+
n=len(nums)
5+
f= [True]*n
6+
foriinrange(1,n):
7+
f[i]=f[i-1]
8+
ifnums[i]<=nums[i-1]:
9+
f[i]=False
10+
g= [True]*n
11+
foriinrange(n-2,-1,-1):
12+
g[i]=g[i+1]
13+
ifnums[i]<=nums[i+1]:
14+
g[i]=False
15+
ans=inf
16+
foriinrange(n-1):
17+
iff[i]andg[i+1]:
18+
s1=s[i]
19+
s2=s[n-1]-s[i]
20+
ans=min(ans,abs(s1-s2))
21+
returnansifans<infelse-1
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
functionsplitArray(nums:number[]):number{
2+
constn=nums.length;
3+
consts:number[]=Array(n);
4+
constf:boolean[]=Array(n).fill(true);
5+
constg:boolean[]=Array(n).fill(true);
6+
7+
s[0]=nums[0];
8+
for(leti=1;i<n;++i){
9+
s[i]=s[i-1]+nums[i];
10+
f[i]=f[i-1];
11+
if(nums[i]<=nums[i-1]){
12+
f[i]=false;
13+
}
14+
}
15+
16+
for(leti=n-2;i>=0;--i){
17+
g[i]=g[i+1];
18+
if(nums[i]<=nums[i+1]){
19+
g[i]=false;
20+
}
21+
}
22+
23+
constINF=Number.MAX_SAFE_INTEGER;
24+
letans=INF;
25+
26+
for(leti=0;i<n-1;++i){
27+
if(f[i]&&g[i+1]){
28+
consts1=s[i];
29+
consts2=s[n-1]-s[i];
30+
ans=Math.min(ans,Math.abs(s1-s2));
31+
}
32+
}
33+
34+
returnans<INF ?ans :-1;
35+
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp