算法
文章平均质量分 80
苹果9090
一颗文科生的心从事理科生的事儿
展开
-
MapReduce作业之--实现网页排名算法PageRank(1)
今天准备写MapReduce的第四个作业,实现pa原创 2014-05-03 15:33:39 · 3687 阅读 · 0 评论 -
leetcode 之Rotate List 解题思路
题目如下:Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.题意:将lianbia原创 2014-07-12 22:50:10 · 727 阅读 · 0 评论 -
leetcode 之Binary Tree Level Order Traversal I和II 解题思路
题目如下:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \原创 2014-07-11 23:43:09 · 2553 阅读 · 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 tree should look like: 1原创 2014-07-08 10:30:51 · 675 阅读 · 0 评论 -
leetcode 之 Two Sum 解题思路
题目如下;Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the targ原创 2014-07-06 20:50:54 · 1107 阅读 · 0 评论 -
leetcode之Permutation Sequence解题思路
题目如下:The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""原创 2014-07-23 21:03:49 · 842 阅读 · 0 评论 -
leetcode 之Spiral Matrix I 和 II 解题思路
题目如下:Spiral Matrix My SubmissionsGiven a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:原创 2014-07-22 18:29:34 · 834 阅读 · 0 评论 -
leetcode之Pascal's Triangle I 和 II 解题思路
该题较简单,这里不再赘述,转载别人的思路转载 2014-07-01 20:29:31 · 792 阅读 · 0 评论 -
leetcode 之 Permutations 解题思路
题目如下:Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].解法原创 2014-07-21 14:20:24 · 730 阅读 · 0 评论 -
LeetCode 之 LRU Cache解决思路
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:get and set.get(key) - Get the value (will always be positive) of the key if原创 2014-06-24 15:56:03 · 810 阅读 · 0 评论 -
leetcode 之Populating Next Right Pointers in Each Node II解题思路
Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant原创 2014-06-26 22:26:35 · 611 阅读 · 0 评论 -
leetcode 之Populating Next Right Pointers in Each Node解题思路
题目如下:Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next r原创 2014-06-26 22:09:52 · 737 阅读 · 0 评论 -
leetcode 之 Gray Code 解题思路
题目如下:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the seque原创 2014-07-16 22:40:43 · 924 阅读 · 0 评论 -
leetcode 之 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 copy of the list.题目大意:深拷贝一个链表,链表除了含有转载 2014-06-24 16:43:55 · 519 阅读 · 0 评论 -
leetcode之 wordBreak(1)解决思路
题目为:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",di原创 2014-06-18 20:21:14 · 776 阅读 · 0 评论 -
如何判断单链表中是否有环?如何找到环中的起始节点
今天在leetcode上做了一道题:原创 2014-06-16 21:42:03 · 1703 阅读 · 0 评论 -
LeetCode之 Reorder List解决思路
题目如下:Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder i原创 2014-06-23 14:37:58 · 644 阅读 · 0 评论 -
leetcode之Validate Binary Search Tree解决思路
题目如下:Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's原创 2014-07-12 14:45:28 · 857 阅读 · 0 评论