我的LeetCode
KevinLinGoGoUp
加油
展开
-
生产者与消费者问题
听说面试会考到生产者消费者问题,今天看了下,根据java的并发程序写了以下代码。写代码最重要的是要弄清楚,一个类里面到底需要哪些属性以及方法,将这些搞清楚后就会发现代码写起来很流畅。一. 单缓冲区 的生产者消费者问题要有:1.仓库 2.消费者 3. 生产者仓库:由于是单缓冲区,只需要一个boolean类型来判断仓库是否为空即可,以及货物的大小,以及放入和提取方法。原创 2016-03-18 22:54:04 · 466 阅读 · 0 评论 -
LeetCode 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2016-03-18 23:24:57 · 249 阅读 · 0 评论 -
LeetCode House Robber III
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour原创 2016-03-18 23:53:08 · 414 阅读 · 0 评论 -
LeetCode Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num = 5原创 2016-03-20 23:24:09 · 830 阅读 · 0 评论 -
LeetCode Self Crossing
You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south,x[3] metres to the east and so原创 2016-03-21 16:14:23 · 326 阅读 · 0 评论 -
LeetCode Verify Preorder Serialization of a Binary Tree
Verify Preorder Serialization of a Binary TreeMy SubmissionsQuestionEditorial SolutionTotal Accepted: 8819 Total Submissions: 28027 Difficulty: MediumOne way to serialize原创 2016-04-04 14:11:25 · 359 阅读 · 0 评论 -
LeetCode Patching Array
Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array. Re转载 2016-04-05 10:33:08 · 269 阅读 · 0 评论 -
编辑距离——动态规划
昨天去了搜狐的宣讲会,做了套笔试题,真的是被鄙视爆了~别的先不说了,这里讲一套笔试的算法题,求编辑距离(有是动态规划!尼奶奶,,,持续懵逼)编辑距离(Edit Distance),又称Levenshtein距离,是指两个字串之间,由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符,插入一个字符,删除一个字符。一般来说,编辑距离越小,两个串的相似原创 2016-03-24 11:34:17 · 585 阅读 · 0 评论 -
JAVA 数组全排列
笔试中遇到的一道题,给出一个数组 ,求其全排列。下面给出java算法。其主要思想还是递归。一class Main{public static void permutation(int[] array,int start,int end){if(start==end){for(int i=0;iSystem.out.print(array[i]);}System.ou原创 2016-03-28 16:50:12 · 590 阅读 · 0 评论