blocks|key|3079713|text|也许是那样？|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3079714|start1+<+end2+and+start2+<+end1|code-block|syntax|javascript|3079715|这意味着:这两个单词的开头早于另一个单词的结尾，因此它们是重叠的。|3079716|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Maybe like that? 

<pre><code>start1 &lt; end2 and start2 &lt; end1
</code></pre>

This means: each of the two words begins earlier than the other word ends, so they do overlap

blocks|key|1731731|text|Case+1：Word+2是单词1的子字符串(或匹配)(反之亦然)|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|1731732|word1+in+word2+or+word2+in+word1|code-block|syntax|javascript|1731733|例如。"StackExchange“和"tack”|1731734|案例2：Word+2在单词1的末尾重叠|1731735|for+i+in+range(1,+len(word2)):+++++word1.endswith(word2[:-i])|CODE|1731736|例如。“堆叠溢出”与“流动”|1731737|案例3：Word+2在单词1的开头重叠|1731738|for+i+in+range(1,+len(word2)):+++++word1.startswith(word2[i:])|1731739|例如。“徽章”和“非常糟糕”|1731740|entityMap^0|0|6|0|0|0|0|3|0|0|1P|0|0|0|3|0|0|1Q|0|0^^$0|@$1|2|3|4|5|6|7|11|8|@$9|12|A|13|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|15|8|@]|D|@]|E|$]]|$1|M|3|N|5|6|7|16|8|@$9|17|A|18|B|C]]|D|@]|E|$]]|$1|O|3|P|5|6|7|19|8|@$9|1A|A|1B|B|Q]]|D|@]|E|$]]|$1|R|3|S|5|6|7|1C|8|@]|D|@]|E|$]]|$1|T|3|U|5|6|7|1D|8|@$9|1E|A|1F|B|C]]|D|@]|E|$]]|$1|V|3|W|5|6|7|1G|8|@$9|1H|A|1I|B|Q]]|D|@]|E|$]]|$1|X|3|Y|5|6|7|1J|8|@]|D|@]|E|$]]|$1|Z|3|-4|5|6|7|1K|8|@]|D|@]|E|$]]]|10|$]]

Case 1: Word 2 is a substring of (or matches) Word 1 (or vice versa)

<pre><code>word1 in word2 or word2 in word1
</code></pre>

ex. "StackExchange" and "tack"

Case 2: Word 2 overlaps at Word 1's end

<code>
for i in range(1, len(word2)):
 word1.endswith(word2[:-i])
</code>

ex. "stackoverflow" and "flowing"

Case 3: Word 2 overlaps at Word 1's beginning

<code>
for i in range(1, len(word2)):
 word1.startswith(word2[i:])
</code>

ex. "badges" and "terribad"

blocks|key|1731745|text|我认为这样的事情很简单，并且满足了你(诚然有点奇怪)的要求。注意，这是使用类似于切片的字符串，与索引的使用相对应，而不是使用单词本身：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1731746|In+[1]:+def+words_overlap(slice1,+slice2):
+++...:+++++"""Take+two+strings+representing+slices+(e.g.+'x:y')+and
+++...:+++++return+a+boolean+indicating+whether+they+overlap"""
+++...:+++++if+slice1[0]+<+slice2[0]:++#+slice1+is+leftmost
+++...:+++++++++return+slice2[0]+<+slice1[2]++#+slice2+ends+before+slice1+starts
+++...:+++++else:
+++...:+++++++++return+slice1[0]+<+slice2[2]
+++...:+

In+[2]:+words_overlap('1:3',+'2:4')
Out[2]:+True

In+[3]:+words_overlap('2:4',+'1:3')
Out[3]:+True

In+[4]:+words_overlap('2:3',+'5:7')
Out[4]:+False

In+[5]:+words_overlap('0:4',+'4:6')
Out[5]:+False|code-block|syntax|javascript|1731747|它所做的就是使用一个简单的小于测试的方法来检测哪个切片是最左边的，然后告诉您最右边的切片是否在最左边的一个结束之前启动。|1731748|应该是相当有效的，因为它只涉及两个整数比较。|1731749|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|P|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

I think something like this is pretty simple and meets your (admittedly a little odd) requirements. Note this is using strings that look like slices, corresponding to your use of indices rather than the words themselves:

<pre><code>In [1]: def words_overlap(slice1, slice2):
 ...: """Take two strings representing slices (e.g. 'x:y') and
 ...: return a boolean indicating whether they overlap"""
 ...: if slice1[0] &lt; slice2[0]: # slice1 is leftmost
 ...: return slice2[0] &lt; slice1[2] # slice2 ends before slice1 starts
 ...: else:
 ...: return slice1[0] &lt; slice2[2]
 ...: 

In [2]: words_overlap('1:3', '2:4')
Out[2]: True

In [3]: words_overlap('2:4', '1:3')
Out[3]: True

In [4]: words_overlap('2:3', '5:7')
Out[4]: False

In [5]: words_overlap('0:4', '4:6')
Out[5]: False
</code></pre>

All it does is detect which slice is leftmost using a simple less than test, and then tell you if the rightmost slice starts before the leftmost one ends.

Should be quite efficient since it only involves two integer comparisons.

blocks|key|3079772|text|如果您正在寻找唯一的重叠字符：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3079773|>>>+set("some+word").intersection(set("other+word"))
{'+',+'d',+'e',+'o',+'r',+'w'}|code-block|syntax|javascript|3079774|或唯一重叠的独特字符的数量：|3079775|>>>+set("some+word").intersection(set("other+word"))
6|3079776|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

If you're looking for unique overlapping chars:
<pre><code>&gt;&gt;&gt; set(&quot;some word&quot;).intersection(set(&quot;other word&quot;))
{' ', 'd', 'e', 'o', 'r', 'w'}
</code></pre>
or the number of unique overlapping unique chars:
<pre><code>&gt;&gt;&gt; set(&quot;some word&quot;).intersection(set(&quot;other word&quot;))
6
</code></pre>

I am trying to determine whether or not two words overlap inside of a string by using their indices (start and end positions) and not the word. 

For example:

<pre><code>str = "testme"
start_word_1 = 0
end_word_1 = 4
start_word_2 = 4
end_word_2 = 6
</code></pre>

In this example str[0:4] is "test" and str[4:6] is "me". These do not overlap but the end of word 1 is the same as start of word 2. So these are okay. I just feel like I'm making it too complicated and there is more simple code for this to cover words that entirely overlap and words that only partially overlap. Thank you!

To clarify overlap: I mean in the string slice str[0:4] ("test") and str[4:6] ("me") do not overlap. They are okay. 

But str[0:5] ("testm") does overlap with str[4:6] ("me"). 

Also, str[0:6] ("testme") does overlap with str[1:4] ("est"), where this one here "est" is completely inside of "testme." 

This is going to be used for text highlighting where I do not want anything to be conflicting highlights.

What is a simple way to check if two words overlap at all in Python using indices

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我试图通过使用两个单词的索引(起始位置和结束位置)而不是单词来确定两个单词是否在字符串中重叠。例如：str = "testme"start_word_1 = 0end_word_1 = 4start_word_2 = 4end_word_2 = 6在这个示例中，str0:4是"test“，而str4:6是"me”。这些...

问使用索引检查Python中两个单词是否重叠的简单方法是什么？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用索引检查Python中两个单词是否重叠的简单方法是什么？EN