1. Çó×Ö·û´®µÄÕýÏò·´Ïò×î´ó¹«¹²×Ö·û´®
package item;
/**
* ÌâÄ¿Çóij¸ö×Ö·û´®ÕýÏòºÍ·´ÏòµÄ×î´ó¹«¹²×Ö·û´®£¬ÈçABCDCBAÊä³öABCDCBA,ABCDEÊä³öAÒòΪAÊǵÚÒ»¸ö£¬ABCDEDCÊä³öCDEDC.
*/
public class max_zifu {
public void ss(String s){
String x=s;
String y=¡±";
String xy=¡±";
int m=x.length();
for(int i=m;i>0;i¨C){ //½«×Ö·û´®·×ª
y=y+x.substring(i-1,i);
}
for(int ii=0;ii for(int j=ii;j // Ç°Á½¸öforÑ»·ÊµÏÖÕýÏò×Ö·û´®µÄËùÓпÉÄܳöÏÖµÄ×Ö·û£¬³ý¹ýÒ»¸ö×Ö·û¡£
String sub=x.substring(ii,j+1);
//System.out.println(sub);
for(int jj=0;jj for(int z=jj;z // ÖмäÁ½¸öforÑ»·ÊµÏÖ·´Ïò×Ö·û´®µÄËùÓбéÀú£¬Í¬Ñù³ý¹ýÒ»¸ö×Ö·û´®µÄÇé¿ö
String subfan=y.substring(jj,z+1);
if(sub.equals(subfan)){
//Èç¹û³öÏÖÏàµÈÔò±£´æÆðÀ´
if(sub.length()>xy.length()){
//Èç¹ûºóÃæÓÐÏàµÈµÄ¹«¹²×Ö·û´®£¬²¢ÇÒÆ䳤¶È´óÓÚÇ°Á½±ßÏàµÈµÄ¹«¹²×Ö·û´®£¬Ôò½«Æ串¸Çµô¡£
xy=sub;
}
}
}
}
}
}
System.out.println(xy);
}
public static void main(String[] args) {
// TODO ×Ô¶¯Éú³É·½·¨´æ¸ù
max_zifu ff=new max_zifu();
ff.ss(¡°1234566¡å);
}
}
package item;
/**
* ÌâÄ¿Çóij¸ö×Ö·û´®ÕýÏòºÍ·´ÏòµÄ×î´ó¹«¹²×Ö·û´®£¬ÈçABCDCBAÊä³öABCDCBA,ABCDEÊä³öAÒòΪAÊǵÚÒ»¸ö£¬ABCDEDCÊä³öCDEDC.
*/
public class Max_Zufu {
public static void main(String[] args) {
// TODO ×Ô¶¯Éú³É·½·¨´æ¸ù
String x = ¡°AE¡±,y=¡±",xy=¡±";
for (int i = x.length(); i > 0; i¨C) {
y = y + x.substring(i ¨C 1, i);
}
for (int i = 0; i < x.length(); i++) {
for (int j = i; j < x.length(); j++) {
String sub = x.substring(i, j + 1);
int z = y.indexOf(sub);
if (z >= 0&&sub.length()>xy.length())
xy = sub;
}
}
System.out.println(xy);
}
}
2. ÈçºÎʵÏÖjavaÖеÄÊ÷
import java.io.*;
class dataitem
{
public long ddata; //one data item
public dataitem(long dd) //constructor
{ ddata = dd;
}
public void displayitem() //display item, format ¡°/27¡å
{ System.out.print(¡°/¡±+ddata);
}
} //end class dataitem
class node
{
private static final int order = 4;
private int numitems;
private node parent;
private node childarray[] = new node[order];
private dataitem itemarray[] = new dataitem[order-1];
// connect child to this node
public void connectchild(int childnum, node child)
{
childarray[childnum] = child;
if(child != null)
child.parent = this;
}
// disconnect child from this node, return it
public node disconnectchild(int childnum)
{
node tempnode = childarray[childnum];
childarray[childnum] = null;
return tempnode;
}
public node getchild(int childnum)
{ return childarray[childnum]; }
public node getparent()
{ return parent; }
public boolean isleaf()
{ return (childarray[0]==null) true : false; }
public int getnumitems()
{ return numitems; }
public dataitem getitem(int index) //get dataitem at index
{ return itemarray[index]; }
public boolean isfull()