This thesis tends to put the sequent words into the reverse words by using a simple program.
通过一个简单的程序,把顺序词转换为倒序词。
With XML and XHTML, you need to close the tags in reverse order — in other words: last opened, first closed.
对于XML和XHTML,您需要以逆序关闭标记—换言之:后开先关。
Two words are a "reverse pair" if each is the reverse of the other. Write a program that finds all the reverse pairs in the word list. Solution.
两个词如果互为逆序,就称它们是『翻转配对』。写一个函数来找一下在这个词汇表中所有这样的词对。 样例代码。
应用推荐