假设字符串数组是str[] = {"ab","cd","ef"},很明显答案就是”abcdef“最小,其实这是一道贪心问题,我的想法是将字符串数组进行内的字符串数组进行排序,这个大思路是没错的,但问题是怎么排序,str[i] < str[j]?这样其实不行,举个反例str[] = {"b","ba"},如果按照那个贪心策略排序,得到的答案是...
思路:冒泡排序,compareTo()或compareToIgnoreCase()比较字符串 packagecom.jn.test;/* * 给定一个字符串数组{"nba","abc","cba","zz","qq","haha"}, * 请按照字典顺序进行从小到大的排序。 */publicclassStringCompositor{publicstaticvoidmain(String[] args){// TODO Auto-generated method stubString[]...