A non-empty array A consisting of N integers is given. Array A represents numbers on a tape.
Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1].
The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])|
In other words, it is the absolute difference between the sum of the first part and the sum of the second part.
For example, consider array A such that:
A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3We can split this tape in four places:
- P = 1, difference = |3 − 10| = 7
- P = 2, difference = |4 − 9| = 5
- P = 3, difference = |6 − 7| = 1
- P = 4, difference = |10 − 3| = 7
Write a function:
class Solution { public int solution(int[] A); }
that, given a non-empty array A of N integers, returns the minimal difference that can be achieved.
For example, given:
A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3the function should return 1, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..100,000];
- each element of array A is an integer within the range [−1,000..1,000].
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> difList = new List<int>();
for(int i = 1; i < A.Length; i++)
{
int totalFormer = 0;
int totalAfter = 0;
int dif = 0;
for(int j = 0; j < i; j++)
{
totalFormer += A[j];
}
for(int j = i; j < A.Length; j++)
{
totalAfter += A[j];
}
dif = System.Math.Abs(totalFormer - totalAfter)
difList.Add(dif);
}
int min = difList[0];
for(int i = 1; i < difList.Length; i ++)
{
if(difList[i] < min)
{
min = difList[i];
}
}
return min;
}
}
Compilation failed: 1 error(s), 0 warnings Solution.cs(32,12): error CS1525: Unexpected symbol `difList'
using System;
using System.Collections.Generic;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> difList = new List<int>();
for(int i = 1; i < A.Length; i++)
{
int totalFormer = 0;
int totalAfter = 0;
int dif = 0;
for(int j = 0; j < i; j++)
{
totalFormer += A[j];
}
for(int j = i; j < A.Length; j++)
{
totalAfter += A[j];
}
dif = System.Math.Abs(totalFormer - totalAfter)
difList.Add(dif);
}
int min = difList[0];
for(int i = 1; i < difList.Length; i ++)
{
if(difList[i] < min)
{
min = difList[i];
}
}
return min;
}
}
Compilation failed: 1 error(s), 0 warnings Solution.cs(33,12): error CS1525: Unexpected symbol `difList'
using System;
using System.Collections.Generic;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> difList = new List<int>();
for(int i = 1; i < A.Length; i++)
{
int totalFormer = 0;
int totalAfter = 0;
int dif = 0;
for(int j = 0; j < i; j++)
{
totalFormer += A[j];
}
for(int j = i; j < A.Length; j++)
{
totalAfter += A[j];
}
dif = System.Math.Abs (totalFormer - totalAfter);
difList.Add(dif);
}
int min = difList[0];
for(int i = 1; i < difList.Count; i ++)
{
if(difList[i] < min)
{
min = difList[i];
}
}
return min;
}
}
using System;
using System.Collections.Generic;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> difList = new List<int>();
for(int i = 1; i < A.Length; i++)
{
int totalFormer = 0;
int totalAfter = 0;
int dif = 0;
for(int j = 0; j < i; j++)
{
totalFormer += A[j];
}
for(int j = i; j < A.Length; j++)
{
totalAfter += A[j];
}
dif = System.Math.Abs (totalFormer - totalAfter);
difList.Add(dif);
}
int min = difList[0];
for(int i = 1; i < difList.Count; i ++)
{
if(difList[i] < min)
{
min = difList[i];
}
}
return min;
}
}
using System;
using System.Collections.Generic;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> difList = new List<int>();
for(int i = 1; i < A.Length; i++)
{
int totalFormer = 0;
int totalAfter = 0;
int dif = 0;
for(int j = 0; j < i; j++)
{
totalFormer += A[j];
}
for(int j = i; j < A.Length; j++)
{
totalAfter += A[j];
}
dif = System.Math.Abs (totalFormer - totalAfter);
difList.Add(dif);
}
int min = difList[0];
for(int i = 1; i < difList.Count; i ++)
{
if(difList[i] < min)
{
min = difList[i];
}
}
return min;
}
}
The following issues have been detected: timeout errors.
large sequence, numbers from -1 to 1, length = ~100,000
running time: >6.00 sec., time limit: 0.30 sec.
random large, length = ~100,000
running time: >6.00 sec., time limit: 0.33 sec.
large sequence, length = ~100,000
running time: 2.29 sec., time limit: 0.27 sec.
large test with maximal and minimal values, length = ~100,000
running time: >6.00 sec., time limit: 0.34 sec.