#算法
暄染落墨
这个作者很懒,什么都没留下…
展开
-
剑指 Offer 07. 重建二叉树
// 递归法class Solution { private Map<Integer,Integer> indexMap = new HashMap<Integer,Integer>(); // 记录中序遍历的顺序 public TreeNode myBuildTree(int[] preorder, int[] inorder, int preLeft, int preRight, int inLeft, int inRight) { if (pr原创 2021-09-28 20:39:01 · 72 阅读 · 0 评论 -
剑指 Offer 06. 从尾到头打印链表
将数组看作一个栈class Solution { public int[] reversePrint(ListNode head) { int[] t = new int[10000]; int i = 0; while (head != null) { t[i++] = head.val; head = head.next; } int[] r = new int[.原创 2021-09-26 21:38:27 · 59 阅读 · 0 评论 -
剑指 Offer 05. 替换空格
class Solution { public String replaceSpace(String s) { StringBuilder tmp = new StringBuilder(); for (int i = 0; i < s.length(); i++) { if (s.charAt(i) == ' ') { tmp.append("%20"); } else {原创 2021-09-26 20:55:13 · 89 阅读 · 0 评论