2014年2月12日
leetcode--Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?/**... 阅读全文
posted @ 2014-02-12 06:31 Averill Zheng 阅读(145) 评论(0) 推荐(0) 编辑
leetcode--Linked List Cycle
摘要： Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Sol... 阅读全文
posted @ 2014-02-12 06:27 Averill Zheng 阅读(150) 评论(0) 推荐(0) 编辑
leetcode--Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following is not: 1 / \ 2 2 \ \ 3 3Note:Bonus points if you could solve it both recursively and iterati... 阅读全文
posted @ 2014-02-12 06:05 Averill Zheng 阅读(133) 评论(0) 推荐(0) 编辑