Codility编程课一PassingCars（Count the number of passing cars on the road.）

最新推荐文章于 2022-03-05 17:35:18 发布

「已注销」

最新推荐文章于 2022-03-05 17:35:18 发布

阅读量758

点赞数

分类专栏： python 文章标签： Codility编程 PassingCars

本文链接：https://blog.csdn.net/lockey23/article/details/81366737

版权

这篇博客讨论了 Codility 的 PassingCars 问题，它涉及到计算在一条路上行驶的车辆中相互交错（即方向相反）的车辆对数。文章提供了一个Python解法，并解释了如何计算这些交错车辆对，同时指出当交错车辆对超过10亿时返回-1。给定的例子显示了解决方案可以正确处理数组A，返回5对交错车辆。

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

PassingCars

Count the number of passing cars on the road.

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] = 1
We have five pairs of passing cars: (0, 1), (0, 3), (0, 4), (2, 3), (2, 4).

Write a function:

int solution(int A[], int N);

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