JSP 泡沫排序法 @ 抓狂小白的程式筆記

以下是閒暇時間做的一款手遊的掛資源用的網頁功能是選擇要的資源然後作排序

應用包含了 Post傳值字串處理(雙引號處理) 一、二維陣列練習泡沫排序法

<HTML>
<HEAD>
<TITLE>少女前線後勤資源排序</TITLE>
</HEAD>
<BODY>
<%
String[] arr={"人力","彈藥","口糧","零件"};
%>
<form name="selection" action="index.jsp" method="post">少女前線後勤資源排序
<p>
<select name="kind" size="1" id="kind"">
<option value="-1" selected> </option>
<%
for(int i=0; i<=arr.length-1;i++)
out.println("<option value=\""+i+"\">"+arr[i]+"</option>");
%>
</select>
<input type="submit" value="Go"/>
<p>
<%
String token = request.getParameter("kind");
int j = -1;
if(token !=null && !token.isEmpty())
j=Integer.parseInt(token.trim());
//out.println(token);
//out.println(arr[0]);
//out.println(arr[token]); //會錯
//out.println(arr[Integer.valueOf(token).intValue()]); //OK
//if (token >=0) { out.println(arr[token]); } //會錯

if (j >=0) { out.println("排序依據 : " + arr[j]); }

int [] [] gfarr={
{0,1,0,145,145,0,0,50},
{0,2,550,0,0,350,3,0},
{0,3,900,900,900,250,12,0},
{0,4,0,120,800,750,24,0},
{1,1,10,30,15,0,0,15},
{1,2,0,40,60,0,0,30},
{1,3,30,0,30,10,1,0},
{1,4,160,160,0,0,2,0},
{2,1,100,0,0,30,0,40},
{2,2,60,200,80,0,1,30},
{2,3,10,10,10,230,4,0},
{2,4,0,250,600,60,6,0},
{3,1,50,0,70,0,0,20},
{3,2,0,120,70,30,0,45},
{3,3,0,300,0,0,1,30},
{3,4,0,0,300,300,5,0},
{4,1,0,185,185,0,1,0},
{4,2,0,0,0,210,2,0},
{4,3,800,550,0,0,6,0},
{4,4,400,400,400,150,8,0},
{5,1,0,0,100,45,0,30},
{5,2,0,600,300,0,2,30},
{5,3,800,400,400,0,4,0},
{5,4,100,0,0,700,7,0},
{6,1,300,300,0,100,2,0},
{6,2,0,200,550,100,3,0},
{6,3,0,0,200,500,5,0},
{6,4,800,800,800,0,12,0},
{7,1,650,0,650,0,2,30},
{7,2,0,650,0,300,4,0},
{7,3,900,600,600,0,5,30},
{7,4,250,250,250,600,8,0},
{8,1,150,150,150,0,1,0},
{8,2,0,0,0,450,3,0},
{8,3,400,800,800,0,6,0},
{8,4,1500,400,400,100,9,0}
};
//out.println(gfarr[2][5]);

if (j >=0) {
   int [] gfarr_tmp;
   //泡沫排序法
   for(int k=0; k<=gfarr.length-2;k++){
   for(int l=gfarr.length-1 ;l>=k+1;l--){
           if (gfarr[k][2+j] < gfarr[l][2+j]){
               gfarr_tmp = gfarr[k];
               gfarr[k] = gfarr[l];
               gfarr[l] = gfarr_tmp;
           }
       }
   }
}
%>

<table border=2 >
<tr>
<td width=80>戰役
<td width=80>關卡
<%
for(int i=0; i<=arr.length-1;i++)
out.println("<td width=80>"+arr[i]);
%>
<td width=80>時間(時)
<td width=80>時間(分)
<tr>
<%
for(int k=0; k<=gfarr.length-1;k++)
{
out.println("<tr>");
for(int l=0 ;l<=gfarr[k].length-1;l++)
{
out.println("<td width=80 > ");
out.println(gfarr[k][l]);
}
out.println("<tr>");
}
%>
</BODY>
</HTML>