agoda first coding

原创

已于 2024-03-04 18:50:31 修改 · 519 阅读

8 ·

CC 4.0 BY-SA版权

文章标签：

#coding

于 2024-03-04 17:48:46 首次发布

本文介绍了一个C++编程任务，旨在实现一个低延迟、高效的时间复杂度为O(N)或更好的函数，用于处理B2B交易中发票与支付的匹配问题。函数需处理边沿情况并优雅地处理错误，同时要求详细注释和有意义的变量名。给出的示例展示了如何根据输入的发票和支付数组，输出匹配的支付和剩余未结余额。

To implement in C++.

The function should take the following inputs and produce the expected outputs (provide examples if there is).

The function should have a time complexity <= O(N) or better and avoid dynamic memory allocations.

It should be optimized for low-latency .

The code need detail comments and use meaningful variable names. The function should handle edge cases and errors gracefully.

The requirements are as follows:

When a company sell product/service to B2B customer, they don't get charged immediately.

The merchant will create an invoice to customer later, which could be bi-weekly, monthly, or quarterly, depends on how good credit they are. Once invoice is created, the merchant have to track how it has been paid, by compare between invoice that we have sent and payment received, which could be exactly match with invoice, or less/greater than the invoice The rule of clearing are - Oldest invoice must be clear