如果有多于一种次序的棕、绿和无色废品箱都满足同一个最少的移动次数，则按照字母表的顺序输入第一个字符串最小的一种。
If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed.
提出了一种集装箱箱号字符粗定位方法。
A rough localization method for container code characters is proposed.
设计字符相关度算法，并由此得到集装箱箱号模糊查询方法。
The character coherence degree algorithm is given and the fuzzy inquiry method for container Numbers is derived.
应用推荐