随笔分类 -  Leetcode

1 2 下一页
[Leetcode]Swap Nodes in Pairs
摘要：Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
posted @ 2015-03-17 22:46 desperadox 阅读(141) 评论(0) 推荐(0)
[Leetcode]Sort Colors
摘要：Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, wh... 阅读全文
posted @ 2015-03-17 22:44 desperadox 阅读(194) 评论(0) 推荐(0)
[Leetcode]Unique Paths
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2015-03-17 22:41 desperadox 阅读(177) 评论(0) 推荐(0)
[Leetcode]Find Minimum in Rotated Sorted Array
摘要：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2015-03-17 22:40 desperadox 阅读(107) 评论(0) 推荐(0)
[Leetcode]Merge Two Sorted Lists
摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.一直没想出原址排序... 阅读全文
posted @ 2015-03-15 23:24 desperadox 阅读(122) 评论(0) 推荐(0)
[Leetcode]Convert Sorted Array to Binary Search Tree
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST.分治是比较好而且容易想到的思路。 1 class Solution { 2 public: 3 T... 阅读全文
posted @ 2015-03-15 23:07 desperadox 阅读(113) 评论(0) 推荐(0)
[Leetcode]Unique Paths
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2015-03-15 22:44 desperadox 阅读(227) 评论(0) 推荐(0)
[Leetcode]Climbing Stairs
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb... 阅读全文
posted @ 2015-03-15 22:10 desperadox 阅读(119) 评论(0) 推荐(0)
[Leetcode]Remove Duplicates from Sorted List
摘要：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.简单题，注意逻辑顺序就好了。 1 class Solution { 2 public: 3 ListNode *d... 阅读全文
posted @ 2015-03-15 21:46 desperadox 阅读(114) 评论(0) 推荐(0)
[Leetcode]Majority Element
摘要：Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume that the arr... 阅读全文
posted @ 2015-03-15 20:48 desperadox 阅读(126) 评论(0) 推荐(0)
[Leetcode]Maximum Subarray
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2015-03-15 00:29 desperadox 阅读(141) 评论(0) 推荐(0)
[Leetcode]Search Insert Position
摘要：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2015-03-15 00:23 desperadox 阅读(111) 评论(0) 推荐(0)
[Leetcode]Binary Tree Inorder Traversal
摘要：Given a binary tree, return theinordertraversal of its nodes' values.和preorder是一样的，把左子节点一直压入到栈中，直到没有左子节点为止，然后出栈访问，存储右子节点。 1 vector inorderTraversal(Tr... 阅读全文
posted @ 2015-03-15 00:08 desperadox 阅读(124) 评论(0) 推荐(0)
[Leetcode]Populating Next Right Pointers in Each Node
摘要：Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set toNULL.Initially, all next ... 阅读全文
posted @ 2015-03-14 23:39 desperadox 阅读(149) 评论(0) 推荐(0)
[Leetcode]Binary Tree Preorder Traversal
摘要：Given a binary tree, return thepreordertraversal of its nodes' values.简单题，递归和迭代都可以解。 1 class Solution { 2 public: 3 vector preorderTraversal(TreeN... 阅读全文
posted @ 2015-03-14 23:18 desperadox 阅读(122) 评论(0) 推荐(0)
[Leetcode]Linked List Cycle
摘要：Given a linked list, determine if it has a cycle in it.简单题，只要知道快慢指针这个技巧就很容易解了。 1 class Solution { 2 public: 3 bool hasCycle(ListNode *head) { 4 ... 阅读全文
posted @ 2015-03-12 23:51 desperadox 阅读(144) 评论(0) 推荐(0)
[Leetcode]Excel Sheet Column Number
摘要：Given a column title as appear in an Excel sheet, return its corresponding column number.本质上是一个进制转换问题。1 class Solution {2 public:3 int titleToNumb... 阅读全文
posted @ 2015-03-12 23:45 desperadox 阅读(108) 评论(0) 推荐(0)
[Leetcode]Unique Binary Search Trees
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?简单动态规划。判别每个左右子树各有多少种情况，然后相乘就可以了，而且是BST，注意这条件就可以解了。它的状态转移方程为： ... 阅读全文
posted @ 2015-03-12 23:28 desperadox 阅读(100) 评论(0) 推荐(0)
[Leetcode]Same Tree
摘要：Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an... 阅读全文
posted @ 2015-03-12 22:24 desperadox 阅读(100) 评论(0) 推荐(0)
[Leetcode]Maximum Depth of Binary Tree
摘要：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le... 阅读全文
posted @ 2015-03-12 22:17 desperadox 阅读(106) 评论(0) 推荐(0)

1 2 下一页