不需要什么 STEP XX ，从今天就开始学英语。

只要能入境，就成功了一大半了，祝福~

LZ 在哪个城市？

thoughtworks 今年裁了多少了？貌似应届生全部给裁了?

@jmk92 这个看起来靠谱，思路是对的。

不对，大家可以用三个测试用例自己跑下测试下。chatGPT 给出的结果和跑出来的不等。
这个题要用 DP+单调栈去解，确实挺难的。

@liqinliqin
@wonderfulcxm

2355. Maximum Number of Books You Can Take


You are given a 0-indexed integer array books of length n where books[i] denotes the number of books on the ith shelf of a bookshelf.

You are going to take books from a contiguous section of the bookshelf spanning from l to r where 0 <= l <= r < n. For each index i in the range l <= i < r, you must take strictly fewer books from shelf i than shelf i + 1.

Return the maximum number of books you can take from the bookshelf.



Example 1:

Input: books = [8,5,2,7,9]
Output: 19
Explanation:
- Take 1 book from shelf 1.
- Take 2 books from shelf 2.
- Take 7 books from shelf 3.
- Take 9 books from shelf 4.
You have taken 19 books, so return 19.
It can be proven that 19 is the maximum number of books you can take.
Example 2:

Input: books = [7,0,3,4,5]
Output: 12
Explanation:
- Take 3 books from shelf 2.
- Take 4 books from shelf 3.
- Take 5 books from shelf 4.
You have taken 12 books so return 12.
It can be proven that 12 is the maximum number of books you can take.
Example 3:

Input: books = [8,2,3,7,3,4,0,1,4,3]
Output: 13
Explanation:
- Take 1 book from shelf 0.
- Take 2 books from shelf 1.
- Take 3 books from shelf 2.
- Take 7 books from shelf 3.
You have taken 13 books so return 13.
It can be proven that 13 is the maximum number of books you can take.

十年前的上海同事说的：“我白天在浦东上班，晚上回上海。”

哪个行业的公司啊？今年怎么行情这么不好？

google “software engineer resume template” 不要太多。

碰到问题 3：“你们用什么 linux”
这种低端问题，建议你直接走人。

有没 trasnfer 的可能？

都是垃圾，做好只能用个 1-2 年的打算。

你这个需求，是保证整个流程，做到消息的 exactly once 处理.
首先需要确认发出去了，每个模块收到了回 ack, 没有就 retry 该模块; 这样保证 > 1; 注意 retry 多次后如果没收到，再到定时任务中设置一段时间后重发，如果再没收到可以放到 dead message queue 中人工处理；
然后每个对端都要 idempotent ，确保收到的消息(maybe > 1)但是只处理 1 次。一般是需要一个 transaction ID 。

@wangkun025 感谢，请问开启了这个不会让入会的其他人看到吧？