Codility-task 1-Tape Equilibrium
2015-07-06 19:01
447 查看
Codility是个great的OJ,用起来非常爽,所以我要来CSDN上安利一下!
网址是 https://codility.com/programmers/challenges/
Task Description
A non-empty zero-indexed 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:
We 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:
int solution(vector<int> &A);
that, given a non-empty zero-indexed array A of N integers, returns the minimal difference that can be achieved.
For example, given:
the function should return 1, as explained above.
Assume that:
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].
Complexity:
expected worst-case time complexity is O(N);
expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified.
题目的等级是easy,无需多言,下边是我的解答。
网址是 https://codility.com/programmers/challenges/
Task Description
A non-empty zero-indexed 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] = 3
We 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:
int solution(vector<int> &A);
that, given a non-empty zero-indexed 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] = 3
the function should return 1, as explained above.
Assume that:
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].
Complexity:
expected worst-case time complexity is O(N);
expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified.
题目的等级是easy,无需多言,下边是我的解答。
//Codility //Zhang Wenjian 07-06-2015 int solution(vector<int> &A) { // write your code in C++11 long long sum; long long th; for(vector<int>::size_type it=0;it<A.size();it++) sum+=A[it]; th=abs(sum-2*A[0]); if(A.size()==2) return abs(A[0]-A[1]); for(vector<int>::size_type it=0;it<A.size()-1;it++) { sum-=2*A[it]; if(abs(sum)<th) th=abs(sum); } return th; }
相关文章推荐
- 如何不让UITableView滚动
- UI_UIStepper控件
- UI_UISwitch控件
- 关于duilib声音和麦音调节slider的问题
- UI_UISlider控件
- EquipmentSlots 装备位置图示
- UI_UISegmentedControl 控件
- Gitlab - Pull Request
- NGUI学习总结
- Java PriorityQueue的使用方法
- UIScrollView中嵌入一个UITableView,使用Masonry来写Autolayout的demo
- UIScrollView详解
- hibernate createQuerySql 映射问题
- Extjs读取本地下拉选框数据源,分为text和value,显示text,传值value
- Call WebService - Request format is unrecognized for URL unexpectedly ending
- iOS开发-UINavigationBar透明设置
- easyui datagrid columns的field支持属性的子属性(field.sonfield形式或者格式化程序形式)
- LinkIssue: Error 'LINK : fatal error LNK1123: failure during conversion to COFF: file invalid or co
- QuickReturnHead的listview的原理
- 在程序中用stmt.executeQuery("select count(1) from tableName")获取到的表的数据量(条数)与实际值不一样(比实际值多几倍)