剑指offer--序列化二叉树

题目描述

请实现两个函数，分别用来序列化和反序列化二叉树

[java]  view plain  copy

1. /* 
2. public class TreeNode { 
3.     int val = 0; 
4.     TreeNode left = null; 
5.     TreeNode right = null; 
6.  
7.     public TreeNode(int val) { 
8.         this.val = val; 
9.  
10.     } 
11.  
12. } 
13. */  
14. import java.util.ArrayList;  
15. public class Solution {  
16.     String Serialize(TreeNode root) {         
17.         if(root==null) return "";  
18.         StringBuilder sb = new StringBuilder();  
19.         ArrayList<TreeNode> queue = new ArrayList<TreeNode>();  
20.         ArrayList<String> result = new ArrayList<String>();  
21.         queue.add(root);  
22.         result.add(root.val+"");              
23.         int low = 0;  
24.         int high = 1;     
25.         while(low<high){           
26.             TreeNode t = queue.get(low);  
27.             if(t.left!=null){                 
28.                 result.add(t.left.val+"");  
29.                 queue.add(t.left);                
30.                 high++;               
31.             }else{  
32.                 result.add("#");                  
33.             }             
34.             if(t.right!=null){  
35.                 result.add(t.right.val+"");  
36.                 queue.add(t.right);               
37.                 high++;  
38.             }else{  
39.                 result.add("#");                  
40.             }             
41.             low++;            
42.         }         
43.           
44.         int i;  
45.         for(i=result.size()-1;i<result.size();i--){  
46.             if(!result.get(i).endsWith("#")) break;  
47.         }         
48.         for(int j=0;j<=i;j++){  
49.             sb.append(result.get(j)).append(",");  
50.         }         
51.         return sb.deleteCharAt(sb.length()-1).toString();         
52.     }  
53.       
54.     TreeNode Deserialize(String str) {  
55.         if(str.length()==0) return null;          
56.         String[] chars = str.split(",");      
57.         ArrayList<TreeNode> queue = new ArrayList<TreeNode>();  
58.         TreeNode t = new TreeNode(Integer.valueOf(chars[0]));  
59.         queue.add(t);  
60.         int low = 0;  
61.         for(int i=0;i<chars.length && low<queue.size();){  
62.             t = queue.get(low);           
63.             if(i+1<chars.length){  
64.                 i++;  
65.                 TreeNode left = null;  
66.                 if(!("#".equals(chars[i]))){                  
67.                     left = new TreeNode(Integer.valueOf(chars[i]));  
68.                     queue.add(left);  
69.                 }                 
70.                 t.left = left;  
71.             }  
72.             if(i+1<chars.length){  
73.                 i++;  
74.                 TreeNode right = null;  
75.                 if(!"#".equals(chars[i])){                
76.                     right = new TreeNode(Integer.valueOf(chars[i]));  
77.                     queue.add(right);  
78.                 }             
79.                 t.right = right;  
80.             }         
81.             low++;  
82.         }  
83.         return queue.get(0);  
84.     }  
85. }  

原文链接 http://blog.csdn.net/crazy__chen/article/details/45113099