mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>我们构建了一个包含 <code>n</code> 行( <strong>索引从 1 开始 </strong>)的表。首先在第一行我们写上一个 <code>0</code>。接下来的每一行,将前一行中的<code>0</code>替换为<code>01</code>,<code>1</code>替换为<code>10</code>。</p>\n\n<ul>\n\t<li>例如,对于 <code>n = 3</code> ,第 <code>1</code> 行是 <code>0</code> ,第 <code>2</code> 行是 <code>01</code> ,第3行是 <code>0110</code> 。</li>\n</ul>\n\n<p>给定行数 <code>n</code> 和序数 <code>k</code>,返回第 <code>n</code> 行中第 <code>k</code> 个字符。( <code>k</code> <strong>从索引 1 开始</strong>)</p>\n\n<p><br />\n<strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 1, k = 1\n<strong>输出:</strong> 0\n<strong>解释: </strong>第一行:<u>0</u>\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 2, k = 1\n<strong>输出:</strong> 0\n<strong>解释:</strong> \n第一行: 0 \n第二行: 0<u>1</u>\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 2, k = 2\n<strong>输出:</strong> 1\n<strong>解释:</strong>\n第一行: 0\n第二行: 0<u>1</u>\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 30</code></li>\n\t<li><code>1 <= k <= 2<sup>n - 1</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 150,
|
||||
"likes": 151,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"46.5K\", \"totalAcceptedRaw\": 20299, \"totalSubmissionRaw\": 46487, \"acRate\": \"43.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"47.1K\", \"totalAcceptedRaw\": 20557, \"totalSubmissionRaw\": 47080, \"acRate\": \"43.7%\"}",
|
||||
"hints": [
|
||||
"Try to represent the current (N, K) in terms of some (N-1, prevK). What is prevK ?"
|
||||
],
|
||||
|
Reference in New Issue
Block a user