start开头end结尾子串及树所有子节点

当阿里伯乐时做题没想法，之后在做：

1.给出字符串s中所有 以start 开头，end结尾的子串

package com.sj;

import java.util.LinkedList;
import java.util.List;

/**
 * 给出字符串中所有 以start 开头，end结尾的子串
 * @author Sen
 * 
 */
public class ClassStringUtil {

	public static void main(String[] args) {
		String str="abcdacdefabcdaabcdddaa";
		List<String> list = ClassStringUtil.allSubStrings(str, "bc", "a");
		System.out.println(list.toString());
	}
	public static List<String> allSubStrings (String str,String start,String end){
		List<String> list = new LinkedList<String>();
		int i = 0; //start 子字符串第一次出现位置
		int j = 0; //end 子字符串第一次出现位置
		String tempStr ="";  //子串
		if(str.length() == 0) {
			return null;
		}
		while(str.length()>0 && str.indexOf(start)>0){
			i = str.indexOf(start);
			str = str.substring(i+start.length());
			tempStr = str;
			while(tempStr.indexOf(end)>0){				
				j = tempStr.lastIndexOf(end);
				tempStr = tempStr.substring(0,j);
				list.add(start+tempStr+end);
			}	
		}		
		return list;
		
	}
}

 2.已知一个树的节点定义如下，求返回该树所有子节点的静态方法。

package com.sj;

import java.util.LinkedList;
import java.util.List;

/**
 * 已知一个树的节点定义如下，求出返回该节点所有孩子的静态方法
 * @author Sen
 *
 */

public class NodeTest {

	public String content;
	
	public List<NodeTest> children;
	
	public String getContent() {
		return content;
	}
	public void setContent(String content) {
		this.content = content;
	}
	public List<NodeTest> getChildren() {
		return children;
	}
	public void setChildren(List<NodeTest> children) {
		this.children = children;
	}
	public NodeTest(String content) {
		this.content = content;
	}
	
	static List<NodeTest> lst = new LinkedList<NodeTest>() ;
	//返回所有子节点
	public static List<NodeTest> allChildren(NodeTest node){
		if(null == node.getChildren() || node.getChildren().size()==0) {
			return null;
		}
		for(NodeTest test:node.getChildren()) {
			lst.add(test);
			allChildren(test);
		}
		return lst;		
	}
	public static void main(String args[]) {
		//定义一个父节点（0代）下两个子节点，子节点1（0代 1）和子节点2（0代2），子节点1下有1_1,1_2,1_3子节点，子节点2下有2_1子节点
		NodeTest parent = new NodeTest("0代");
		NodeTest children0_1 = new NodeTest("0代 1");
		NodeTest children0_2 = new NodeTest("0代2");
		NodeTest children1_1 = new NodeTest("1代 1");
		NodeTest children2_1 = new NodeTest("2代 1");
		NodeTest children1_2 = new NodeTest("1代 2");
		NodeTest children1_3 = new NodeTest("1代 3");
		List<NodeTest> node0_1 = new LinkedList<NodeTest>();
		node0_1.add(children1_2);
		node0_1.add(children1_1);
		node0_1.add(children1_3);
		children0_1.setChildren(node0_1);  //组装节点1子节点
		List<NodeTest> node0_2 = new LinkedList<NodeTest>();
		node0_2.add(children2_1);
		children0_2.setChildren(node0_2); //组装节点2子节点
		List<NodeTest> node0 = new LinkedList<NodeTest>();
		node0.add(children0_1);
		node0.add(children0_2);
		parent.setChildren(node0); //组装parent
		List<NodeTest> list = allChildren(parent);
		System.out.println(list.size());
	}
}