3.1 PassingCars

最新推荐文章于 2021-02-13 00:27:15 发布

zll00561

最新推荐文章于 2021-02-13 00:27:15 发布

阅读量772

点赞数

分类专栏：算法 codility 文章标签： codility

本文链接：https://blog.csdn.net/zll00561/article/details/44965661

版权

算法同时被 2 个专栏收录

21 篇文章 0 订阅

订阅专栏

codility

5 篇文章 0 订阅

订阅专栏

博客探讨了在包含0和1的数组中计算通过车辆对数的问题。给定一个数组A，0表示车辆向东行驶，1表示车辆向西行驶。一对通过的车辆是指一辆向东行驶的车辆和一辆向西行驶的车辆。例如，数组A=[0, 1, 0, 1, 1]中有五对通过的车辆。函数solution(A)应返回通过车辆对的数量，若超过1亿则返回-1。解决方案包括利用额外空间复杂度为O(1)的方法遍历数组来统计通过车辆。" 124801263,315221,STM32CubeIDE中DWT精确延时实现,"['STM32', '嵌入式硬件', 'DWT', 'STM32CubeIDE', '物联网']

摘要由CSDN通过智能技术生成

A non-empty zero-indexed 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] = 1
We have five pairs of passing cars: (0, 1), (0, 3), (0, 4), (2, 3), (2, 4).
Write a function:
class Solution { public int solution(int[] A); }
that, given a non-empty zero-indexed 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] = 1
the function should return 5, as explained above.
Assume that:
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.
Complexity:
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).

Solution

class Solution {
    public int solution(int[] A) {
        int sumofZero=0;
        int result=0;
        for(int i=0; i<A.length; i++){
            if(A[i]==0) sumofZero++;
            else{
                result+=sumofZero;
            }
        }
       if(result < 0 || result > 1000000000)
       return -1;
       return result;
    }   
}