求职 - 随笔分类 - Double_win

[LeetCode 题解]：Candy

摘要：There areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requi... 阅读全文

posted @ 2014-07-20 22:03 Double_win 阅读(1094) 评论(0) 推荐(0)

华为2014机试题（一）

摘要：过几天就要进行华为的机试了，今儿临时抱抱佛脚，在网上找到2014届华为校招的机试题，琢磨了一会儿，贴出来记录下。首先感谢一下Hackbuteer提供的题目：http://blog.csdn.net/hackbuteer1/article/details/11132567对于第一题，字符过滤。最简单也... 阅读全文

posted @ 2014-06-27 11:15 Double_win 阅读(611) 评论(0) 推荐(0)

[LeetCode 题解]: Count and Say

摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11.11 is read off 阅读全文

posted @ 2014-06-11 10:36 Double_win 阅读(255) 评论(0) 推荐(0)

[LeetCode 题解]: String to Interger (atoi)

摘要：Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below 阅读全文

posted @ 2014-06-01 17:50 Double_win 阅读(459) 评论(0) 推荐(0)

[LeetCode 题解]: Interger to Roman

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to ... 阅读全文

posted @ 2014-05-30 21:41 Double_win 阅读(213) 评论(0) 推荐(0)

[LeetCode 题解]: Longest Substring Without Repeating Characters

摘要：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo 阅读全文

posted @ 2014-05-30 17:21 Double_win 阅读(151) 评论(0) 推荐(0)

[LeetCode 题解]: Roman to Interger

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to ... 阅读全文

posted @ 2014-05-29 20:40 Double_win 阅读(307) 评论(0) 推荐(0)

[LeetCode题解]: Sort Colors

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given an array with n objects colored red, white or blue, sort them so that objects of the same color a... 阅读全文

posted @ 2014-05-29 18:02 Double_win 阅读(273) 评论(0) 推荐(0)

[LeetCode 题解]: palindromes

摘要：Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thi 阅读全文

posted @ 2014-05-26 10:50 Double_win 阅读(208) 评论(0) 推荐(0)

[LeetCode 题解]: Two Sum

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given an array of integers, find two numbers such that they add up to a specific target number. The fu... 阅读全文

posted @ 2014-05-25 23:19 Double_win 阅读(144) 评论(0) 推荐(0)

[LeetCode 题解]: Maximum Subarray

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum... 阅读全文

posted @ 2014-05-22 22:56 Double_win 阅读(233) 评论(0) 推荐(0)

[LeetCode 题解]：Gas Station

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You h... 阅读全文

posted @ 2014-05-22 22:38 Double_win 阅读(285) 评论(0) 推荐(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 tot 阅读全文

posted @ 2014-05-22 16:53 Double_win 阅读(238) 评论(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 l 阅读全文

posted @ 2014-05-19 17:27 Double_win 阅读(194) 评论(0) 推荐(0)

[LeetCode 题解]: Minimum Depth of Binary Tree

摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文

posted @ 2014-05-19 17:19 Double_win 阅读(280) 评论(0) 推荐(0)

[LeetCode 题解]： Triangle

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numb... 阅读全文

posted @ 2014-05-05 15:01 Double_win 阅读(368) 评论(0) 推荐(0)

[LeetCode 题解]: pow(x,n)

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Implement pow(x, n). 2. 思路题目很精简，不过需要考虑的情况很多，特别的需要注意 n可能为0 或者负数的情况。另外，通过二分法，可以减少计算量。 3. 解法 clas... 阅读全文

posted @ 2014-05-04 16:59 Double_win 阅读(191) 评论(0) 推荐(0)

[LeetCode 题解]: plusOne

摘要：前言【LeetCode 题解】系列传送门： http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given a non-negative number represented as an array of digits, plus one to the number. The digits ar... 阅读全文

posted @ 2014-05-04 11:39 Double_win 阅读(251) 评论(0) 推荐(0)

微软2014实习生招聘笔试第2题 the k-th string

摘要：Time Limit: 10000msCase Time Limit: 1000msMemory Limit: 256MB Description Consider a string set that each of them consists of {0, 1} only. All strings 阅读全文

posted @ 2014-04-12 21:16 Double_win 阅读(481) 评论(2) 推荐(0)

面试题：已知一个含有n个不同元素的集合，要求打印其所有具有k个元素的子集（不允许有重复的）

摘要：TX面试题2：已知一个含有n个元素的集合，要求打印其所有具有k个元素的子集（不允许有重复的）题目分析，为了便于说明，不妨将问题简化一下：已知一个盒子中有n个不同的球，分别标记为{a1,a2,...,an}，现在需要从中取出其中任意k个球，求给出各种组合。首先，从组合数学的角度，我们可以知道本问... 阅读全文

posted @ 2014-04-08 21:34 Double_win 阅读(1839) 评论(0) 推荐(0)

Double_win

Nothing is impossible for a willing heart!

随笔分类 - 求职

公告