leetcode day28 搜索与回溯

最新推荐文章于 2024-07-09 23:43:07 发布

爱吃的小肥

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量66

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/zhiyun_wu/article/details/129588063

版权

剑指 Offer 37. 序列化二叉树

思路：序列化就是回溯算法，中左右，注意返回的是字符串；反序列化就是先把字符串通过“，”分隔开，用到队列建立二叉树。

public class Codec {

   // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        if (root == null)
            return "null,";
//        StringBuilder sb = new StringBuilder();
        String res = root.val + ",";
        res += serialize(root.left);
        res += serialize(root.right);
        return res;
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] arr = data.split(",");
        Queue<String> queue = new LinkedList<String>();
        for (int i=0;i<arr.length;i++){
            queue.offer(arr[i]);
        }
        return help(queue);
    }

    private TreeNode help(Queue<String> queue){
        String val = queue.poll();
        if (val.equals("null"))
            return null;
        TreeNode root = new TreeNode(Integer.valueOf(val));
        root.left = help(queue);
        root.right = help(queue);
        return root;
    }
}

剑指 Offer 38. 字符串的排列

思路：其实还是个回溯算法，就是刚开始没想明白

public String[] permutation(String s) {
        HashSet<String> set = new HashSet<>();
        dfs(new boolean[s.length()],s,new StringBuilder(),set);
        return set.toArray(new String[set.size()]);
    }
    public void dfs(boolean[] status,String s,StringBuilder temp,HashSet<String> set){
        if (temp.length() == status.length){
            set.add(temp.toString());
            return;
        }
        for (int i=0;i<status.length;i++){
            if (!status[i]){
                status[i] = true;
                temp.append(s.charAt(i));
                dfs(status,s,temp,set);
                //回溯
                status[i] = false;
                temp = temp.deleteCharAt(temp.length()-1);
            }
        }
    }