coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 05:13:29 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
leetcode-cn/problem (English)/插入(English) [insert-into-bits-lcci].html
View File

@@ -1,15 +1,15 @@
<p>You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: N = 10000000000, M = 10011, i = 2, j = 6
<strong> Output</strong>: N = 10001001100
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: N = 0, M = 11111, i = 0, j = 4
<strong> Output</strong>: N = 11111
</pre>
<p>You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: N = 10000000000, M = 10011, i = 2, j = 6
<strong> Output</strong>: N = 10001001100
</pre>