Algorithm
wolf96
Welcome, I'm Lin Dong. I am an U3D Programmer in ShangHai, I love Game Developing and Rendering, I will be absorbed in it.here is my GitHub URL https://github.com/wolf96
email URL wolf_crixus@sina.cn
展开
-
面试笔试杂项积累-leetcode 179-190
189.189-Rotate Array-Difficulty: EasyRotate an array of n elements to the right byk steps.For example, with n = 7 and k = 3, the array[1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Note:原创 2016-02-08 22:53:58 · 508 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 221-225
221.221-Combination Sum III-Difficulty: MediumGiven a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following ma原创 2016-02-11 23:24:45 · 710 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 226-230
226.226- Implement Stack using Queues-Difficulty: EasyInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This p原创 2016-02-12 21:39:45 · 617 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 231-235
231.231-Power of Two-Difficulty: EasyGiven an integer, write a function to determine if it is a power of two.方法一思路判断一个数是否是2的幂除和取余,循环public class Solution { public bool IsPowerOfTwo原创 2016-02-12 22:00:50 · 587 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 236-240
236.236-Lowest Common Ancestor of a Binary Tree-Difficulty: MediumGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA o原创 2016-02-12 22:27:00 · 578 阅读 · 1 评论 -
面试笔试杂项积累-leetcode 241-245
242.242-Valid Anagram-Difficulty: EasyGiven two strings s and t, write a function to determine ift is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t =原创 2016-02-12 22:30:35 · 624 阅读 · 0 评论 -
分治算法 Divide and Conquer Algorithm
分而治之,指的是分治算法.分治算法是基于多分枝递归的一种算法设计模式.分治算法递归地把一个大问题分解为多个类型相同的子问题,直到这些子问题足够的简单能被直接解决.最后把这些子问题的解结合起来就能得到原始问题的解.原文:http://www.cnblogs.com/Gavin_Liu/archive/2011/04/15/2015469.html先看一段来自wikipedia的定义:转载 2016-02-13 07:42:59 · 887 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 246-260
257.257-Binary Tree Paths-Difficulty: EasyGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths ar原创 2016-02-13 22:26:39 · 739 阅读 · 4 评论 -
面试笔试杂项积累-leetcode 261-270
263.263-Ugly Number-Difficulty: EasyWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example, 6,原创 2016-02-13 22:44:10 · 672 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 41-45
41.41-First Missing Positive-Difficulty: HardGiven an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant space.思路给一个原创 2016-01-31 10:33:53 · 582 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 36-40
待原创 2016-01-31 10:33:04 · 563 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 31-35
31.31-Next Permutation-Difficulty:MediumImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, i原创 2016-01-30 09:16:59 · 518 阅读 · 0 评论 -
Trie(数字树、字典树、前缀树)
原文:http://www.cnblogs.com/huangxincheng/archive/2012/11/25/2788268.htmlTrie树的名字有很多,比如字典树,前缀树等等。一:概念 下面我们有and,as,at,cn,com这些关键词,那么如何构建trie树呢?从上面的图中,我们或多或少的可以发现一些好玩的特性。 第一:根节点不包含字符,转载 2016-02-10 10:18:28 · 2623 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 201-205
202.202-Happy Number-Difficulty: EasyWrite an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, repla原创 2016-02-09 22:12:16 · 642 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 206-210
206.206-Reverse Linked List-Difficulty: EasyReverse a singly linked list.方法一思路把链表反过来第一种方法,改值,全存到list中,反过来赋值,比较差的方法/** * Definition for singly-linked list. * public class ListNode {原创 2016-02-10 11:37:40 · 428 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 26-30
26.26-Remove Duplicates from Sorted Array-Difficulty: EasyGiven a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate原创 2016-01-29 13:35:26 · 526 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 191-200
191.191-Number of 1 Bits-Difficulty: EasyWrite a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For example, the 32-bit int原创 2016-02-08 22:57:26 · 499 阅读 · 0 评论 -
快速选择SELECT算法的深入分析与实现
leetcode 215Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] a转载 2016-02-11 17:22:51 · 9044 阅读 · 1 评论 -
面试笔试杂项积累-leetcode 211-215
211.211-Add and Search Word - Data structure design-Difficulty: MediumDesign a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can s原创 2016-02-11 22:49:52 · 744 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 216-220
216.216-Combination Sum III-Difficulty: MediumFind all possible combinations of k numbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination should原创 2016-02-11 23:21:33 · 642 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 46-50
46.46-Permutations-Difficulty:MediumGiven a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3],原创 2016-01-31 10:51:23 · 539 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 271-280
273.273-Integer to English Words-Difficulty: MediumConvert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example,123 -> "O原创 2016-02-13 23:03:49 · 719 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 281-285
283.283-Move Zeroes-Difficulty: EasyGiven an array nums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums原创 2016-02-13 23:07:46 · 603 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 71-75
6天刷了70多道。从开始一天2-3道到10多道一天,感觉浑身上下酸爽啊,,,希望越刷越快71.71-Simplify Path-Difficulty:MediumGiven an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"pa原创 2016-02-01 23:18:17 · 517 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 76-80
76.76-Combinations-Difficulty: MediumGiven two integers n and k, return all possible combinations ofk numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4原创 2016-02-02 22:29:45 · 438 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 81-85
81.81-Search in Rotated Sorted Array II-Difficulty: MediumFollow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?原创 2016-02-02 22:38:37 · 489 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 86-90
88.88-Merge Sorted Array-Difficulty: EasyGiven two sorted integer arrays nums1 andnums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that原创 2016-02-02 22:44:16 · 473 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 91-95
91.91-Decode Ways-Difficulty: MediumA message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message conta原创 2016-02-03 23:04:46 · 711 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 96-100
96.96-Unique Binary Search Trees-Difficulty: MediumGiven n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 u原创 2016-02-04 22:48:43 · 508 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 101-105
101.101-Symmetric Tree-Difficulty: EasyGiven 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原创 2016-02-04 23:02:51 · 845 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 106-110
博主今天一天做了19道题,嗯,可喜可贺107.107-Binary Tree Level Order Traversal II-Difficulty: EasyGiven a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right,原创 2016-02-04 23:21:41 · 419 阅读 · 0 评论 -
各大Oj平台介绍
1.题库与网站资源题库-在线提交系统(Online Judge)简介 下面是几个比较大的在线提交系统(OnlineJudge)里面有大量历年的竞赛题目,注册一个ID,然后用自己熟悉的语言(一般有Pascal/C/C++/Java)写好源代码提交即可,会实时返回信息告诉你是否正确。采用黑箱测试,系统里有一套标准的输入输出数据(对外保密,而且通常数据很多很怪),你的程序的输出和标准输出完全转载 2016-02-05 07:02:59 · 2989 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 311-320
318.318-Reconstruct Itinerary-Difficulty: MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. I原创 2016-02-15 22:30:15 · 755 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 331-335
至此2016-2-15,全部333道题除去锁题和不想做的= =。就都做完了。。。331.331-Verify Preorder Serialization of a Binary Tree-Difficulty: MediumOne way to serialize a binary tree is to use pre-order traversal. When we e原创 2016-02-15 23:07:55 · 1293 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 286-290
289.289-Game of Life-Difficulty: MediumAccording to the Wikipedia's article: "The Game of Life, also known simply asLife, is a cellular automaton devised by the British mathematician John Ho原创 2016-02-13 23:14:22 · 751 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 291-300
292.292-Nim Game-Difficulty: EasyYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one w原创 2016-02-13 23:22:34 · 714 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 301-305
303.303-Range Sum Query - Immutable-Difficulty: EasyGiven an integer array nums, find the sum of the elements between indicesi and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5,原创 2016-02-14 22:27:27 · 921 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 306-310
306.306-Additive Number-Difficulty: MediumAdditive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the fi原创 2016-02-14 22:35:40 · 837 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 56-60
56.56-Merge Intervals-Difficulty:HardGiven a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].思路查找数组集中是原创 2016-01-31 22:54:32 · 541 阅读 · 0 评论 -
面试笔试杂项积累-leetcode 61-65
61.61-Rotate List-Difficulty:MediumGiven 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->NUL原创 2016-02-01 22:54:57 · 426 阅读 · 0 评论