回答此问题可获得 20 贡献值,回答如果被采纳可获得 50 分。
<p>这应该是一个简单的问题,但我还没有找到解决办法。
以下是练习:</p>
<blockquote>
<p>Start with 4 words “comfortable”, “round”, “support”, “machinery”, return a list of all possible 2 word combinations.<br/>
<br/>
Example: <code>["comfortable round", "comfortable support", "comfortable machinery", ...]</code></p>
</blockquote>
<p>我已经开始编写一个循环,它将遍历每个元素,从索引[0]处的元素开始:</p>
<pre><code>words = ["comfortable, ", 'round, ', 'support, ', 'machinery, ']
index_zero= words[0]
for i in words:
words = index_zero + i
words_one = index_one + i
print(words)
</code></pre>
<pre><code>>>> Output=
comfortable, comfortable,
comfortable, round,
comfortable, support,
comfortable, machinery
</code></pre>
<p>问题是我想从第二个元素(“round”)开始迭代。我尝试过操作索引(索引[0]+1),但它当然不会返回任何内容,因为元素是字符串。
我知道需要进行从字符串到索引的转换,但我不确定如何进行</p>
<p>我也尝试过定义一个函数,但它不会返回任何函数</p>
<pre><code>word_list = ["comfortable, ", 'round, ', 'support, ', 'machinery, ']
index_change = word_list[0]+ 1
def word_variations(set_of_words):
for i in set_of_words:
set_of_words = set_of_words[0] + i
set_of_words = word_variations(word_list)
print(set_of_words)
</code></pre>