给出了由N个整数组成的非空零索引数组A.阵列A的连续元素表示道路上的连续车辆.
数组A仅包含0和/或1:
0 represents a car traveling east,
1 represents a car traveling west.
目标是计算过往车辆.我们说一对汽车(P,Q),其中0≤P<1. Q
A[0] = 0
A[1] = 1
A[2] = 0
A[3] = 1
A[4] = 1
我们有五对过往车辆:(0,1),(0,3),(0,4),(2,3),(2,4).
写一个函数:
class Solution { public int solution(int[] A); }
如果给定N个整数的非空零索引数组A,则返回过往车辆的数量.
如果过往车辆的数量超过1,000,000,000,该功能应返回-1.
例如,给定:
A[0] = 0
A[1] = 1
A[2] = 0
A[3] = 1
A[4] = 1
该函数应返回5,如上所述.
假使,假设:
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.
复杂:
expected worst-case time complexity is O(N);
expected worst-case space complexity is O(1), beyond input storage (not counting the storage required for input arguments).
可以修改输入数组的元素.
我不明白为什么有五辆过往车,而不是6.为什么不(2,1)算作过往车?有人可以提供一些解决方法来解决这个问题吗?