<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML> <HEAD> <TITLE> New Document </TITLE> <META NAME="Generator" CONTENT="EditPlus"> <META NAME="Author" CONTENT=""> <META NAME="Keywords" CONTENT=""> <META NAME="Description" CONTENT=""> </HEAD> <BODY>
<script> function putValue(value) {
var array=value.split("/");
var p=root; for(var i=0;i<array.length;i++) {
if(p[array[i]]==null) {p[array[i]]=new Object();} p=p[array[i]]; } } function print(o,depth) { for(var key in o) { var child=o[key]; for(var i=0;i<depth;i++) document.write(" "); document.write(key+"<br>");
print(child,depth+1); }
} var root=new Object();
var value="192.168.0.16/share/manager/cc.exe"; putValue(value); var value="192.168.0.16/javashare/manager/zz.exe"; putValue(value); document.write("<br>"); print(root,0); </script> </BODY> </HTML>上面是我花了15分钟写出来的代码,保存为网页即可。--------------------- websharp, 最好最简单的web技术. http://blog.csdn.net/coolmasoft
var a=new Array('192.168.0.16/share/manager/cc.exe', '192.168.0.16/javashare/manager/zz.exe', '192.168.0.12/share/manager/hh.exe ','192.168.0.16/share/color/mm.exe'); var z="" var t="" for(var i=0;i<a.length;i++){ var str=a[i].split('\/'); for(var j=0;j<str.length;j++){ var b=str[j]; if(i==0){ document.write(z+t+b); z="<br>" t=t+"—" } else { if(j==0){t="";} document.write(z+t+b); z="<br>" t=t+"—"
}
} } 不知道是不是这效果
var sortedArray = new Array(); /** *function: put the PATH string into an array sorted by host ip *@param str Path */ function sort(str) { var strs = str.split("/"); var host = strs[0]; var hasSameHost = false; for(var i =0; i < sortedArray.length; i++) { var temp = sortedArray[i]; if (temp[0] == host) { temp[temp.length] = str; hasSameHost = true; break; } } if (!hasSameHost) { var temp = new Array; temp[0] = host; temp[1] = str; sortedArray[sortedArray.length] = temp; } } 分别将各个字符串引用该函数,最后结果在sortedArray中,它是一个数组类型的数组,不知道是否能满足LZ的要求。
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
<HEAD>
<TITLE> New Document </TITLE>
<META NAME="Generator" CONTENT="EditPlus">
<META NAME="Author" CONTENT="">
<META NAME="Keywords" CONTENT="">
<META NAME="Description" CONTENT="">
</HEAD> <BODY>
<script> function putValue(value)
{
var array=value.split("/");
var p=root;
for(var i=0;i<array.length;i++)
{
if(p[array[i]]==null) {p[array[i]]=new Object();}
p=p[array[i]];
}
} function print(o,depth)
{
for(var key in o)
{
var child=o[key];
for(var i=0;i<depth;i++) document.write(" ");
document.write(key+"<br>");
print(child,depth+1);
}
} var root=new Object();
var value="192.168.0.16/share/manager/cc.exe";
putValue(value);
var value="192.168.0.16/javashare/manager/zz.exe";
putValue(value); document.write("<br>");
print(root,0); </script>
</BODY>
</HTML>上面是我花了15分钟写出来的代码,保存为网页即可。---------------------
websharp, 最好最简单的web技术. http://blog.csdn.net/coolmasoft
var z=""
var t=""
for(var i=0;i<a.length;i++){
var str=a[i].split('\/');
for(var j=0;j<str.length;j++){
var b=str[j];
if(i==0){
document.write(z+t+b);
z="<br>"
t=t+"—"
}
else {
if(j==0){t="";}
document.write(z+t+b);
z="<br>"
t=t+"—"
}
}
}
不知道是不是这效果
/**
*function: put the PATH string into an array sorted by host ip
*@param str Path
*/
function sort(str) {
var strs = str.split("/");
var host = strs[0];
var hasSameHost = false;
for(var i =0; i < sortedArray.length; i++) {
var temp = sortedArray[i];
if (temp[0] == host) {
temp[temp.length] = str;
hasSameHost = true;
break;
}
}
if (!hasSameHost) {
var temp = new Array;
temp[0] = host;
temp[1] = str;
sortedArray[sortedArray.length] = temp;
}
}
分别将各个字符串引用该函数,最后结果在sortedArray中,它是一个数组类型的数组,不知道是否能满足LZ的要求。