注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
今天做了这两道题 好难理解啊。。。
先说深度复制随机链表,首先不懂这个哈希表的意思,是前后结点对的意思吗?其次,里面新建了四个结点newhead, node, pre, tem, 求大神解释一下怎么实现:
public RandomListNode copyRandomList(RandomListNode head) {
// write your code here
if (head == null) {
return null;
}
HashMap<RandomListNode, RandomListNode> map =
new HashMap<RandomListNode, RandomListNode> ();
RandomListNode newhead = new RandomListNode(head.label);
map.put(head, newhead);
RandomListNode node = head.next;
RandomListNode pre = newhead;
while (node != null) {
RandomListNode tem = new RandomListNode(node.label);
map.put(node, tem);
pre.next = tem;
pre = pre.next;
node = node.next;
}
node = head;
pre = newhead;
while (node != null) {
pre.random = map.get(node.random);
pre = pre.next;
node = node.next;
}
return newhead;
}
这个是排序链表转换为二叉树,我的问题是:为什么在helper()函数里调用过TreeNode left = helper(res, start, mid - 1)之后,ArrayList res(0)就变成了res里mid的值?
public TreeNode sortedListToBST(ListNode head) {
// write your code here
if (head == null) {
return null;
}
ArrayList<ListNode> res = new ArrayList<ListNode>();
res.add(head);
int count = 0;
ListNode cur = head;
while (cur != null) {
cur = cur.next;
count++;
}
return helper(res, 0, count - 1);
}
public TreeNode helper(ArrayList<ListNode> res, int start, int end) {
int mid = (start + end) / 2;
if (start > end) {
return null;
}
TreeNode left = helper(res, start, mid - 1);
TreeNode root = new TreeNode(res.get(0).val);
res.set(0, res.get(0).next);
root.left = left;
root.right = helper(res, mid + 1, end);
return root;
}
求各位讲解一下怎么理解的,或者更好的思路吧! |