小菜刷题史

2014年5月21日

摘要： Implementint sqrt(int x).Compute and return the square root ofx. 1 class Solution { 2 public: 3 int sqrt(int x) { 4 if (x mid) { // 不要用x ... 阅读全文

posted @ 2014-05-21 12:30 小菜刷题史阅读(125) 评论(0) 推荐(0)

【Leetcode】Longest Common Prefix

摘要： Write a function to find the longest common prefix string amongst an array of strings. 1 class Solution { 2 public: 3 string longestCommonPrefix(v... 阅读全文

posted @ 2014-05-21 12:00 小菜刷题史阅读(130) 评论(0) 推荐(0)

【Leetcode】Search for a Range

摘要： Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文

posted @ 2014-05-21 11:42 小菜刷题史阅读(198) 评论(0) 推荐(0)

【Leetcode】Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文

posted @ 2014-05-21 11:11 小菜刷题史阅读(163) 评论(0) 推荐(0)

【Leetcode】Flatten Binary Tree to Linked List

摘要： Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文

posted @ 2014-05-21 10:46 小菜刷题史阅读(121) 评论(0) 推荐(0)

2014年5月20日

【Leetcode】Remove Duplicates from Sorted List II

摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文

posted @ 2014-05-20 23:42 小菜刷题史阅读(158) 评论(0) 推荐(0)

【Leetcode】Reverse Linked List II

摘要： Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文

posted @ 2014-05-20 22:44 小菜刷题史阅读(147) 评论(0) 推荐(0)

【Leetcode】Jump Game

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu... 阅读全文

posted @ 2014-05-20 18:33 小菜刷题史阅读(134) 评论(0) 推荐(0)

【Cracking the Code Interview(5th edition)】二、链表(C++)

摘要：链表结点类型定义：1 class Node {2 public:3 int data = 0;4 Node *next = nullptr;5 6 Node(int d) {7 data = d;8 }9 };快行指针(runner)技巧：同时... 阅读全文

posted @ 2014-05-20 18:13 小菜刷题史阅读(375) 评论(0) 推荐(0)

【Leetcode】Path Sum II

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文

posted @ 2014-05-20 12:31 小菜刷题史阅读(168) 评论(0) 推荐(0)

公告