算法之一刀切法
package obj.first;public class First {
public static void main(String[] args) {
//一刀切下式(事后修正法)
String s3 = "abcd";
String s4 = "";
for (int x = 0;x < s3.length();x++){
s4+=","+s3.charAt(x);
}
s4 = s4.substring(1);
System.out.println(s4);
//一刀切上式(事先补齐法)
String s = "aaa,bbb ccc ddd";
s+=",";
String s2 = "";
for (int i = 0;i < s.length();i++){
char c = s.charAt(i);
if (c == ' ' || c==','){
System.out.println(s2);
s2 = "";
}else{
s2+=c;
}
}
//System.out.println(s2); but 我们不这样做
}
}
一刀切上式简单粗暴，下式则精益求精
java论坛真的...{:10_334:}
页:
[1]