LeetCode 449. Serialize and Deserialize BST
来源:互联网 发布:java后端开发教程 编辑:程序博客网 时间:2024/05/19 01:29
原题网址:https://leetcode.com/problems/serialize-and-deserialize-bst/
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
Design an algorithm to serialize and deserialize a binary search tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary search tree can be serialized to a string and this string can be deserialized to the original tree structure.
The encoded string should be as compact as possible.
Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.
方法:采用二进制数据格式进行序列化和反序列化。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Codec { private void code(TreeNode node, StringBuilder coded) { if (node == null) return; char flag = (char)0; if (node.left != null) flag |= (char)1; if (node.right != null) flag |= (char)2; coded.append(flag); for(int i = 0, val = node.val; i < 4; i++, val >>>= 8) { coded.append((char)(val & 0xff)); } code(node.left, coded); code(node.right, coded); } private TreeNode decode(String data, int[] pos) { if (pos[0] >= data.length()) return null; char flag = data.charAt(pos[0]++); int val = 0; for(int i = 0; i < 4; i++) { val |= (data.charAt(pos[0]++) << (i * 8)); } TreeNode node = new TreeNode(val); if ((flag & 1) != 0) { node.left = decode(data, pos); } if ((flag & 2) != 0) { node.right = decode(data, pos); } return node; } // Encodes a tree to a single string. public String serialize(TreeNode root) { if (root == null) return ""; StringBuilder coded = new StringBuilder(); code(root, coded); return coded.toString(); } // Decodes your encoded data to tree. public TreeNode deserialize(String data) { return decode(data, new int[] {0}); }}// Your Codec object will be instantiated and called as such:// Codec codec = new Codec();// codec.deserialize(codec.serialize(root));
- LeetCode 449. Serialize and Deserialize BST
- LeetCode 449. Serialize and Deserialize BST
- LeetCode 449. Serialize and Deserialize BST
- 【LeetCode】 449. Serialize and Deserialize BST
- Leetcode-449. Serialize and Deserialize BST
- [leetcode]449. Serialize and Deserialize BST
- LeetCode 449. Serialize and Deserialize BST
- 【Leetcode】449. Serialize and Deserialize BST
- leetcode 449. Serialize and Deserialize BST
- [LeetCode]Serialize and Deserialize BST
- 449. Serialize and Deserialize BST**
- 449. Serialize and Deserialize BST
- 449. Serialize and Deserialize BST
- 449. Serialize and Deserialize BST
- [leetcode] 449. Serialize and Deserialize BST 解题报告
- Leetcode 449. Serialize and Deserialize BST (Medium) (cpp)
- [Leetcode] 449. Serialize and Deserialize BST 解题报告
- Leetcode 449 Serialize and Deserialize BST
- Android之懒人框架 ButterKnife 8.4添加使用
- Java PAT练习1.0
- Android自定义星星评分控件,高效
- 204. Count Primes
- send_recv_writev_readv
- LeetCode 449. Serialize and Deserialize BST
- MYSQL5.5的手动编译安装
- 7. Reverse Integer 一个简单但是非常考察思维全面性的题目。
- C++实现窗口显示在最前面的代码
- Python Unicode 基本知识
- Viewpager使用时注意的东西
- 构建知识图谱,让自己更值钱
- 263. Ugly Number
- 【LeetCode】 023. Merge k Sorted Lists