java-相同字符的遍历

/**/
public class Cmp{
public int cmp(char[] src,char[] dest){
for(int i=0;i+dest.length<=src.length;i++){
int j=i;
int x;
for(x=0;x<dest.length;x++){
if(src[i]==dest[x]){
i++;
}
else
break;

}
if(x==dest.length)
return j;
}
return -1;
}
public int cmp1(String src,String dest){
if(src==null&&dest==null)
return 0;
if(src==null)
return -1;
if(dest==null)
return 0;
for(int i=0;i+dest.length()<=src.length();i++){
int j=i;
int x;
for(x=0;x<dest.length();x++){
if(src.charAt(i)==dest.charAt(x)){
i++;
}
else
break;

}
if(x==dest.length())
return j;
}
return -1;
}















public static void main(String[] args){
Cmp c=new Cmp();
char[] a={'a','b','c'};
char[] b={'b','d'};
System.out.println(c.cmp1(null,"abd"));
}
}
















class TreeNode{
private int data;


private:
int data;
int* leftChild;
int* rightChild;
}


class  BinaryTree{
private:
TreeNode* root;
}




void inOrder(TreeNode* currentNode){
if(currentNode){
inOrder(currentNode->leftChild);
visit(currentNode);
inOrder(currentOrder->right);
}
}
void visit(TreeNode* currentNode){
std::cout<<currentNode->data<<endl;
}