- 博客(23)
- 资源 (27)
- 收藏
- 关注
原创 程序员找工作经验
我是2013.04.01左右的时候开始准备找工作的,找工作的时候自己有些迷茫:1.不知道想要从事什么方向的工作;2.不知道要去哪里工作。于是我在网上搜了很多的面经,另外找了几本书看了下,后来决定了以下几个方向:1.图像、视觉;2.分布式计算或存储;3.机器学习;4.北美求职。虽然上面列了这么多条,但是这些方向的面试都会有算法面试,所以我首先就开始了算法的练习,在这里我推荐几个不错的网站:1
2014-04-29 00:10:21 9182 20
原创 [codility]MinAvgTwoSlice
Python代码如下:def solution(A): # write your code in Python 2.6 # if one slice is the MA, then the average of its subslices # can not be smaller and also it can not be bigger, or the avera
2014-04-24 22:17:55 2416
原创 [codility]GenomicRangeQuery
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc
2014-04-22 21:45:31 1668
原创 [codility]GenomicRangeQuery
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc
2014-04-21 23:25:33 877
原创 [codility]GenomicRangeQuery
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc
2014-04-21 23:25:23 710
原创 [codility]GenomicRangeQuery
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc
2014-04-21 23:04:40 891
原创 [codility]GenomicRangeQuery
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc
2014-04-21 23:03:24 1040
原创 [codility]Task description
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuclS
2014-04-21 23:01:03 962
原创 [codility]Task description
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuclS
2014-04-21 23:00:45 915
原创 [codility]Task description
Python代码如下:def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuclS
2014-04-21 22:59:29 842
原创 [codility]PassingCars
Python代码如下:def solution(A): # write your code in Python 2.6 curZeroCnt = 0 totalPairs = 0 for value in A: if value == 0: curZeroCnt += 1 else:
2014-04-21 22:12:24 1412
原创 [codility]MaxCounters
Python代码如下:def solution(N, A): # write your code in Python 2.6 maxCount = 0 lastMaxSetter = 0 counters = [0]*N for op in A: if op == N+1: lastMaxSetter = maxC
2014-04-20 22:38:24 1748
原创 [codility]FrogRiverOne
Python代码如下:def solution(X, A): # write your code in Python 2.6 checkCrucialTable = [False]*X crucialCnt = 0 for i in xrange(0, len(A)): if not checkCrucialTable[A[i]-1]:
2014-04-20 11:46:28 1914
原创 [codility]PermCheck
Python代码如下:def solution(A): # write your code in Python 2.6 checkTable = [False]*len(A) for value in A: if value len(A): return 0 checkTable[value-1] = True
2014-04-19 16:32:45 1442
原创 [codility]PermMissingElem
Python代码如下:def solution(A): # write your code in Python 2.6 curSum = 0 originalSum = 0 if len(A)%2 == 0: originalSum = (len(A)+1)*((len(A)+2)/2) else: originalSum
2014-04-19 14:55:56 1247
原创 [codility]FrogJmp
Python代码如下:def solution(X, Y, D): # write your code in Python 2.6 dis = Y-X if dis%D == 0: return dis/D else: return dis/D+1 pass
2014-04-18 22:57:37 1145
原创 [codility]TapeEquilibrium
题目:A non-empty zero-indexed array A consisting of N integers is given. Array A represents numbers on a tape.Any integer P, such that 0 The difference between the two parts is the value of: |
2014-04-16 22:58:17 1571
原创 [codility]NailingPlanks
题目网址:https://codility.com/c/run/demoR97YT5-9FEPython代码如下(最近在熟悉Python所以接下来的解题报告会尽量使用Python):def solution(A, B, C): # write your code in Python 2.6 # for each plank find the nearest nail
2014-04-16 21:46:02 2394
原创 [codility]MinMaxDivision
题目网址:https://codility.com/c/run/demoR97YT5-9FEPython代码如下(最近在熟悉Python所以接下来的解题报告会尽量使用Python):def solution(K, A): # write your code in Python 2.6 # each time given an expected minimum sum 'em
2014-04-14 22:48:00 3384
原创 [LeetCode]Reverse Words in a String
class Solution {public: void reverseWords(string &s) { string word; stack wordsStack; stringstream ss(s); while(ss>>word) { wordsStack.push(word); } st
2014-04-12 17:46:30 1000
原创 [LeetCode]Evaluate Reverse Polish Notation
class Solution {public: int evalRPN(vector &tokens) { stack numStack; //for each token in the tokens for(int i = 0; i < tokens.size(); ++i) { //if the
2014-04-10 22:45:13 1040
原创 [LeetCode]Max Points on a Line
/** * Definition for a point. * struct Point { * int x; * int y; * Point() : x(0), y(0) {} * Point(int a, int b) : x(a), y(b) {} * }; */class Solution { public: int max
2014-04-09 21:59:35 1350
原创 北美求职之寻找内推资源
2013年下半年的时候准备过一阵子北美求职,但是后来没能求职成功。虽然没能成功,但是还是想分享自己在整个过程中积累的一些经验,希望能让他人少走些弯路。我将按如下解答问题的方式来展开全文的叙述。1. 为什么需要内推?北美各大公司网申系统上每年都会有海量应聘者,被recruiter或是hr(其实我还不是很懂这两者的区别,有知道的留个言哈,非常感谢)注意到时很困难的。而且公司一般比较相信内推,因
2014-04-08 22:40:05 5353 8
color transfer 颜色转化
2011-12-06
c语言DOS界面菜单式四则运算自编(菜单功能很不错宝贵资源)
2009-03-10
Vc6.0++MFC编程实例4讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例15讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例14讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例13讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例12讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例11讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例10讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例9讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例8讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例7讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例6讲解详细(宝贵资源)
2009-03-10
Vc6.0++MFC编程实例1讲解详细(宝贵资源)
2009-03-09
Vc6.0++MFC编程实例2讲解详细(宝贵资源)
2009-03-09
链表C语言实现 功能齐全
2009-03-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人