A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road.
Array A contains only 0s and/or 1s:
- 0 represents a car traveling east,
- 1 represents a car traveling west.
The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is traveling to the east and Q is traveling to the west.
For example, consider array A such that:
A[0] = 0 A[1] = 1 A[2] = 0 A[3] = 1 A[4] = 1We have five pairs of passing cars: (0, 1), (0, 3), (0, 4), (2, 3), (2, 4).
Write a function:
function solution(A);
that, given a non-empty array A of N integers, returns the number of pairs of passing cars.
The function should return −1 if the number of pairs of passing cars exceeds 1,000,000,000.
For example, given:
A[0] = 0 A[1] = 1 A[2] = 0 A[3] = 1 A[4] = 1the function should return 5, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer that can have one of the following values: 0, 1.
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0, west = 0;
for(var i=0;i<A.length;i++){
if(A[i]) west ++;
else east ++;
}
return east+west;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0, west = 0;
for(var i=0;i<A.length;i++){
if(A[i]) west ++;
else east ++;
}
return east*west-1;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var pass=0, west = 0;
for(var i=0;i<A.length;i++){
if(A[i] === 0) pass += west;
else west ++;
if(pass > 1e9) return -1;
}
return pass;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var zCount = 0; // how many going east
var passing = 0; // total passing pairs
for(var i =0;i< A.length;i++){
if(i == 1){
passing += zCount;
}
else zCount++;
}
if(passing > 1e9 || passing < 0) return -1;
else return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(i == 1){
passing += east;
}
else east++;
}
if(passing > 1e9 || passing < 0) return -1;
else return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
}
else east++;
}
if(passing > 1e9 || passing < 0) return -1;
else return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
if(passing > 1e9) return -1;
}
else east++;
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
if(passing > 1e9) return -1;
}
else east++;
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[0, 0]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
if(passing > 1e9) return -1;
}
else east++;
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[0, 0]
[1, 1]
function result: 51
function result: 0
function result: 0
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
if(passing > 1e9) return -1;
}
else east++;
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[0, 0]
[1, 1]
[1, 1, 1, 1, 1, 1, 0]
function result: 51
function result: 0
function result: 0
function result: 0
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east;
if(passing > 1e9) return -1;
}
else east++;
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[0, 0]
[1, 1]
[1, 1, 1, 1, 1, 1, 0]
[0, 1, 1, 1, 1, 1, 1, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east; // pair only count (0,1)
if(passing > 1e9) return -1;
}
else east++; // increasing numbers of car go to east (0)
}
return passing;
}
[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1]
[0, 0]
[1, 1]
[1, 1, 1, 1, 1, 1, 0]
[0, 1, 1, 1, 1, 1, 1, 1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 4.0.0)
var east = 0; passing = 0;
for(var i = 0; i< A.length; i++){
if(A[i] == 1){
passing += east; // pair only count (0,1)
if(passing > 1e9) return -1;
}
else east++; // increasing numbers of car go to east (0)
}
return passing;
}
The solution obtained perfect score.