Skip to content

docs: update lcof problem: No.044 #3777

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 19, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcof/%E9%9D%A2%E8%AF%95%E9

<!-- description:start -->

<p>数字以0123456789101112131415&hellip;的格式序列化到一个字符序列中。在这个序列中,第5位(从下标0开始计数)是5,第13位是1,第19位是4,等等。</p>
<p>数字以123456789101112131415&hellip;的格式序列化到一个字符序列中。在这个序列中,第5位是5,第13位是1,第19位是4,等等。</p>

<p>请写一个函数,求任意第n位对应的数字。</p>

Expand Down
Loading