- 博客(11)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 Implement Trie
Implement a trie with insert, search, and startsWith methods.trie树实现javaclass TrieNode { TrieNode[] children; boolean hasWord; public TrieNode() { children = new TrieNode[26]; ...
2018-03-29 09:03:44
207
原创 Meeting Rooms
线扫描求解Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.Have you met this question in a real...
2018-03-26 11:00:45
222
原创 Number of Airplanes in the Sky
线扫描问题Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? NoticeIf landing and flying happens at the same time, we consider landing should...
2018-03-26 10:32:37
283
原创 Find Peak Element II
There is an integer matrix which has the following features:The numbers in adjacent positions are different.The matrix has n rows and m columns.For all i < m, A[0][i] < A[1][i] && A[n - ...
2018-03-25 17:31:03
487
转载 公布代码的大牛
序号姓名链接1南京大学，周志华主页， LMADA实验室主页2香港理工大学，张磊主页3深圳大学，杨猛主页4哈尔滨工业大学深圳研究生院，徐勇主页5University of Exeter，Yiming Ying个人主页 ，代码主页6浙江大学，蔡登个人主页 ，代码主页7中科院自动化所，向世明个人主页8MA YI个人主页9中科院自动化所 Shiguang Shan （山世光）个人主页 代码主页10深圳大...
2018-03-22 15:28:56
2297
1
原创 Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the array...
2018-03-20 09:29:22
249
原创 leetcode 2. Add Two Numbers
2. Add Two NumbersYou are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two nu...
2018-03-17 16:29:43
181
原创 Leetcode 24. Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant ...
2018-03-17 12:15:05
151
原创 Leetcode 92. Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m,...
2018-03-17 08:52:48
169
转载 GBDT算法解析
在网上看到一篇对从代码层面理解gbdt比较好的文章，转载记录一下： GBDT(Gradient Boosting Decision Tree) 又叫 MART（Multiple Additive Regression Tree)，是一种迭代的决策树算法，该算法由多棵决策树组成，所有树的结论累加起来做最终答案。它在被提出之初就和SVM一起被认为是泛化能力（generaliz...
2018-03-08 10:03:09
917
原创 阿里巴巴（电面一）
阿里巴巴（电面一）在之前的一天约定时间进行电话面试，第二天面试官非常准时的打来电话。因为需要进行在线的写代码，所以在教室里进行的电面。首先自我介绍，然后介绍项目，面试官根据项目提出了一些问题。主要包括推荐系统的异常值的处理、svd的表示、相似度的传递，大概使用了20分钟左右。接下来讲了所做的反作弊的项目，此时面试官提出的问题比较尖锐，比如随机森林的过程（不是讲大概的流程，是以伪代码的形式写出一步步...
2018-03-06 15:52:02
709
1
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人