Staircase
比较简单的问题Beat the previous 要求你从给定的digits 数列中贪婪地提取一个严格升序的整数序列。例如，对于digits 等于"31415926" ，列表 。 (list)返回的整数应为[3, 14, 15, 92] ，最后一个原始数字未使用。
与直觉有些相悖的是，随意跳过某些digits 的能力可能会使结果中的 list的整数包含的元素可能会多于之前以贪婪方式构建的列表。有了这种额外的自由度，数字字符串"31415926" 的示例将允许结果[3, 4, 5, 9, 26] 比贪心构建的解决方案多一个元素。
您的函数应该返回最长的...
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
checkio sync
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium
Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.
Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!
You are trying to join a pair programming session that has not started yet.
Please wait for the session creator to join.
It looks like the creator of the pair programming session closed the editor window.
It might happen accidentally, so that you can wait for reconnection.
