blocks|key|4442956|text|假设单词文件每行包含一个单词：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4442957|puts+File.read('/usr/share/dict/words').lines.select+{%7Cl%7C+(4..9).cover?(l.strip.size)}.sample.strip|code-block|syntax|javascript|4442958|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Assuming that the words file contains one word per line:

<pre><code>puts File.read('/usr/share/dict/words').lines.select {|l| (4..9).cover?(l.strip.size)}.sample.strip
</code></pre>

blocks|key|4442928|text|pick+=+words.select+{+%7Cw%7C+w.size+>+3+&&+w.size+<+10+}.sample|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|4442929|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>pick = words.select { |w| w.size &gt; 3 &amp;&amp; w.size &lt; 10 }.sample
</code></pre>

blocks|key|4837340|text|这应该是为了你：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4837341|file_contents+=+File.read("/usr/share/dict/words")
words+=+file_contents.split("\n")
puts+words[rand(0..words.size-1)]|code-block|syntax|javascript|4837342|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

This should do it for you:

<pre><code>file_contents = File.read("/usr/share/dict/words")
words = file_contents.split("\n")
puts words[rand(0..words.size-1)]
</code></pre>

blocks|key|4837369|text|最有效的方法是使用Random|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|4837370|rng+=+Random.new
words+=+File.readlines("/usr/share/dict/words")
words.select!{+%7Ce%7C+s+=+e.size;+s+>=+4+&&+s+<=+9+}
pick+=+words[rng(words.size)]|code-block|syntax|javascript|4837371|您也可以使用#shuffle，但是这会生成一个新的列表，因此肯定很重：|4837372|words+=+File.readlines("/usr/share/dict/words")
words.select!{+%7Ce%7C+s+=+e.size;+s+>=+4+&&+s+<=+9+}
pick+=+words.shuffle.first|4837373|如果单词没有用换行符分隔，请使用split|4837374|words+=+File.read("/usr/share/dict/words").split|4837375|entityMap^0|9|6|0|0|6|8|0|0|G|5|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@]|E|$]]|$1|M|3|N|5|H|7|11|8|@]|D|@]|E|$I|J]]|$1|O|3|P|5|6|7|12|8|@$9|13|A|14|B|C]]|D|@]|E|$]]|$1|Q|3|R|5|H|7|15|8|@]|D|@]|E|$I|J]]|$1|S|3|-4|5|6|7|16|8|@]|D|@]|E|$]]]|T|$]]

Most efficient is to use <code>Random</code>:

<pre><code>rng = Random.new
words = File.readlines("/usr/share/dict/words")
words.select!{ |e| s = e.size; s &gt;= 4 &amp;&amp; s &lt;= 9 }
pick = words[rng(words.size)]
</code></pre>

You can also use <code>#shuffle</code> but this generates a new list so is certainly heavy:

<pre><code>words = File.readlines("/usr/share/dict/words")
words.select!{ |e| s = e.size; s &gt;= 4 &amp;&amp; s &lt;= 9 }
pick = words.shuffle.first
</code></pre>

If words are not separated by newlines, use <code>split</code>:

<pre><code>words = File.read("/usr/share/dict/words").split
</code></pre>

blocks|key|4837387|text|pick+=+ar.sample+until+pick.to_s.size.between?(4,+9)|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|4837388|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>pick = ar.sample until pick.to_s.size.between?(4, 9)
</code></pre>

blocks|key|4837474|text|如果您不需要在给定的大小范围内随机选择大量的单词，下面是为速度而构建的方法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4837475|码|offset|length|style|BOLD|4837476|def+random_word(fname,+size_range,+window)
++f+=+File.open(fname,+'r')
++fsize+=+f.size
++loop+do
++++f.seek(rand(fsize))+#+Random+start+byte,+likely+within+a+word
++++next+if+f.eof?
++++f.readline+#+Go+next+word
++++window.times+do
++++++break+if+f.eof
++++++w+=+f.readline.strip
++++++if+size_range.cover?+w.size
++++++++f.close
++++++++return+w
++++++end
++++end
++end
end|code-block|syntax|javascript|4837477|示例|4837478|words+=
'Now
is
the
time
for+
all
Rubyists
to
do
some
coding'

FNAME+=+'dict'
File.write(FNAME,words)

random_word(FNAME,+(4..6),+3)+#=>+"some"
random_word(FNAME,+(4..6),+3)+#=>+"time"
random_word(FNAME,+(4..6),+3)+#=>+"some"

random_word(FNAME,+(2..3),+5)+#=>+"the"
random_word(FNAME,+(2..3),+5)+#=>+"for"
random_word(FNAME,+(2..3),+5)+#=>+"is"

random_word(FNAME,+(6..8),+3)+#=>+"Rubyists"
random_word(FNAME,+(6..8),+3)+#=>+"coding"
random_word(FNAME,+(6..8),+3)+#=>+"coding"|4837479|解释|4837480|有两种情况需要考虑。|4837481|在给定的长度范围内，必须同时生成大量的随机词。在这里，用限定词构造数组是有意义的，然后随机选择偏移量。如果字典没有随着时间的推移而改变，这些数组就可以被写入文件，用于每个感兴趣的大小范围。|unordered-list-item|4837482|一次只会产生少量的随机词，或者所需的大小范围经常改变。在这种情况下，在随机选择一个(满足长度要求)之前，将字典中的所有单词读入数组将是非常低效的。我所谈到的正是后一种情况。|4837483|4837484|4837485|算法非常简单：|4837486|通过字典文件中的偏移量生成随机值。|4837487|将文件指针移动到该字节，该字节很可能位于一个单词的中间。|4837488|读取该行的其余部分(除非已经在文件末尾)。|4837489|读取指定数量的单词(或直到文件结束)，搜索指定大小范围内的单词。|4837490|如果找到一个单词，它将被返回，否则文件指针将被移动到一个新的随机偏移量并重复该进程。|4837491|4837492|4837493|从给定的随机文件指针偏移量(在随机移动文件指针之前)搜索给定数量的单词最多是为了保持随机性，但可能不是很重要。如果这个参数有效地是%2B无穷大，它将搜索从随机位置到文件末尾，这将稍微偏向于选择更接近文件末尾的单词。|4837494|这种方法确实有一个缺陷:在一些字典中，它对"aardvark“一词的选择有偏见。|4837495|entityMap^0|0|0|1|0|0|0|2|0|0|0|2|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|1M|8|@$D|1N|E|1O|F|G]]|9|@]|A|$]]|$1|H|3|I|5|J|7|1P|8|@]|9|@]|A|$K|L]]|$1|M|3|N|5|6|7|1Q|8|@$D|1R|E|1S|F|G]]|9|@]|A|$]]|$1|O|3|P|5|J|7|1T|8|@]|9|@]|A|$K|L]]|$1|Q|3|R|5|6|7|1U|8|@$D|1V|E|1W|F|G]]|9|@]|A|$]]|$1|S|3|T|5|6|7|1X|8|@]|9|@]|A|$]]|$1|U|3|V|5|W|7|1Y|8|@]|9|@]|A|$]]|$1|X|3|Y|5|W|7|1Z|8|@]|9|@]|A|$]]|$1|Z|3|-4|5|6|7|20|8|@]|9|@]|A|$]]|$1|10|3|-4|5|6|7|21|8|@]|9|@]|A|$]]|$1|11|3|12|5|6|7|22|8|@]|9|@]|A|$]]|$1|13|3|14|5|W|7|23|8|@]|9|@]|A|$]]|$1|15|3|16|5|W|7|24|8|@]|9|@]|A|$]]|$1|17|3|18|5|W|7|25|8|@]|9|@]|A|$]]|$1|19|3|1A|5|W|7|26|8|@]|9|@]|A|$]]|$1|1B|3|1C|5|W|7|27|8|@]|9|@]|A|$]]|$1|1D|3|-4|5|6|7|28|8|@]|9|@]|A|$]]|$1|1E|3|-4|5|6|7|29|8|@]|9|@]|A|$]]|$1|1F|3|1G|5|6|7|2A|8|@]|9|@]|A|$]]|$1|1H|3|1I|5|6|7|2B|8|@]|9|@]|A|$]]|$1|1J|3|-4|5|6|7|2C|8|@]|9|@]|A|$]]]|1K|$]]

If you don't need to randomly select a large number of words in a given size range, here is a method built for speed.

Code

<pre><code>def random_word(fname, size_range, window)
 f = File.open(fname, 'r')
 fsize = f.size
 loop do
 f.seek(rand(fsize)) # Random start byte, likely within a word
 next if f.eof?
 f.readline # Go next word
 window.times do
 break if f.eof
 w = f.readline.strip
 if size_range.cover? w.size
 f.close
 return w
 end
 end
 end
end
</code></pre>

Examples

<pre><code>words =
'Now
is
the
time
for 
all
Rubyists
to
do
some
coding'

FNAME = 'dict'
File.write(FNAME,words)

random_word(FNAME, (4..6), 3) #=&gt; "some"
random_word(FNAME, (4..6), 3) #=&gt; "time"
random_word(FNAME, (4..6), 3) #=&gt; "some"

random_word(FNAME, (2..3), 5) #=&gt; "the"
random_word(FNAME, (2..3), 5) #=&gt; "for"
random_word(FNAME, (2..3), 5) #=&gt; "is"

random_word(FNAME, (6..8), 3) #=&gt; "Rubyists"
random_word(FNAME, (6..8), 3) #=&gt; "coding"
random_word(FNAME, (6..8), 3) #=&gt; "coding"
</code></pre>

Explanation

There are two situation to consider.

<ul>
<li>A very large number of random words in a given length range must be generated at one time. Here it would make sense to construct an array with qualifying words and then just select offsets at random. If the dictionary did not change over times, these arrays could be written to file, on for each size range of interest.</li>
<li>Only a modest number of random words are to be generated at a time, or the desired size range frequently changed. In these cases, reading all the words in the dictionary into an array before selecting one (meeting the length requirement) at random would be highly inefficient. It is this latter situation that I have addressed.</li>
</ul>

The algorithm is very simple:

<ul>
<li>Generate a random by offset within the dictionary file.</li>
<li>Move the file pointer to that byte, which likely will be in the middle of a word.</li>
<li>Read the rest of that line (unless already at the end of the file).</li>
<li>Read up to a specified number of words (or until the end of the file is reached), searching for one within the specified size range.</li>
<li>If a word is found, it is returned, else the file pointer is moved to a new random offset and the process is repeated.</li>
</ul>

The reason for searching for at most a given number of words from a given random file pointer offset (before randomly moving the file pointer) is to maintain randomness, but is probably not very important. If this parameter were effectively +infinity, it would search to from the random location to the end of the file, which would slightly bias the selection of words closer to the end of the file. 

This method does have a flaw: in several dictionaries it is biased against the selection of the word "aardvark".

blocks|key|4837539|text|dictionary+=+File.readlines(filename)
sample_word+=+dictionary.sample.chomp
until+sample_word.length.between?(5,+12)
++sample_word+=+dictionary.sample.chomp
end
puts+sample_word|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|4837540|chomp还删除回车字符(也就是说，它将删除\n、\r和\r\n)。|unstyled|offset|length|style|CODE|4837541|entityMap^0|0|0|5|M|2|P|2|S|4|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|N|8|@$G|O|H|P|I|J]|$G|Q|H|R|I|J]|$G|S|H|T|I|J]|$G|U|H|V|I|J]]|9|@]|A|$]]|$1|K|3|-4|5|F|7|W|8|@]|9|@]|A|$]]]|L|$]]

<pre><code>dictionary = File.readlines(filename)
sample_word = dictionary.sample.chomp
until sample_word.length.between?(5, 12)
 sample_word = dictionary.sample.chomp
end
puts sample_word
</code></pre>

<code>chomp</code> also removes carriage return characters (that is it will remove <code>\n</code>, <code>\r</code>, and <code>\r\n</code>).

The dict txt file is located at: /usr/share/dict/words
I need to access the words on that list and randomly puts a word that contains between 4-9 letters for the user.

How can I return a randomly selected word from the dict file?

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

dict文件位于:/usr/share/dict/ word，我需要访问该列表中的单词，并随机为用户放置一个包含4-9个字母的单词。

问如何从dict文件中返回随机选择的单词？
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何从dict文件中返回随机选择的单词？EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何从dict文件中返回随机选择的单词？
EN