__Neo - 博客园

2015年8月21日

【LeetCode】138. Copy List with Random Pointer

摘要：题目：A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep co... 阅读全文

posted @ 2015-08-21 20:34 __Neo 阅读(2494) 评论(0) 推荐(0) 编辑

【LeetCode】36. Valid Sudoku

摘要：题目：Determine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled wi... 阅读全文

posted @ 2015-08-21 16:34 __Neo 阅读(142) 评论(0) 推荐(0) 编辑

2015年8月20日

【LeetCode】202. Happy Number

摘要：题目：Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive inte... 阅读全文

posted @ 2015-08-20 21:33 __Neo 阅读(210) 评论(0) 推荐(0) 编辑

【LeetCode】242. Valid Anagram

摘要：题目：Given two stringssandt, write a function to determine iftis an anagram ofs.For example,s= "anagram",t= "nagaram", return true.s= "rat",t= "car", re... 阅读全文

posted @ 2015-08-20 19:12 __Neo 阅读(110) 评论(0) 推荐(0) 编辑

【LeetCode】219. Contains Duplicate II

摘要：题目：Given an array of integers and an integerk, find out whether there are two distinct indicesiandjin the array such thatnums[i] = nums[j]and the diff... 阅读全文

posted @ 2015-08-20 16:00 __Neo 阅读(137) 评论(0) 推荐(0) 编辑

【LeetCode】217. Contains Duplicate

摘要：题目：Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the ... 阅读全文

posted @ 2015-08-20 11:06 __Neo 阅读(133) 评论(0) 推荐(0) 编辑

【LeetCode】94. Binary Tree Inorder Traversal

摘要：题目：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].N... 阅读全文

posted @ 2015-08-20 10:27 __Neo 阅读(166) 评论(0) 推荐(0) 编辑

2015年8月19日

【LeetCode】116. Populating Next Right Pointers in Each Node

摘要：题目：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next poi... 阅读全文

posted @ 2015-08-19 18:55 __Neo 阅读(162) 评论(0) 推荐(0) 编辑

【LeetCode】144. Binary Tree Preorder Traversal

摘要：题目：Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].... 阅读全文

posted @ 2015-08-19 16:17 __Neo 阅读(109) 评论(0) 推荐(0) 编辑

【LeetCode】141. 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?提示：首先，题目中要求'without using extra space'，... 阅读全文

posted @ 2015-08-19 15:15 __Neo 阅读(110) 评论(0) 推荐(0) 编辑

jdneo

公告