oldsui-CSDN博客

原创 Leetcode 252 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. For example, Given [[0, 30],[5, 10],[15

2016-06-21 11:51:47 340

原创 Maximum Subarray III

Given an array of integers and a number k, find k non-overlapping subarrays which have the largest sum. The number in each subarray should be contiguous. Example Given [-1,4,-2,3,-2,3], k

2015-11-11 14:47:00 477

原创 Maximum Subarray Difference Solution

这道题感觉非常有意思，值得记录一下。思路来源：https://codesolutiony.wordpress.com/2015/05/28/lintcode-maximum-subarray-difference/ public class Solution { /** * @param nums: A list of integers * @return:

2015-10-22 17:39:35 347

转载如何插入公式

http://www.codecogs.com/latex/eqneditor.php 搞定后copy + paste 参考：http://blog.csdn.net/sangyongjia/article/details/34913467

2015-07-10 22:22:59 357

原创 20150708 MyEclipse Hibernate Many To Many Mapping

Many-To-Many 例子：创建三张表: Person: uid uname 1 Jason Project: pid pro_name 1 java Pro_per: 关联person 和 project，表示参与了项目的人。uid 和 pid 为联合主键

2015-07-09 22:29:23 344

原创 20150708 MyEclipse Hibernate Setup

记录一下 MyEclipse 上hibernate 的设置过程。最简单的例子：我自己的有一个mysql database 叫做bookstore，里面其中一张表叫做book，通过hibernate 逆向生成类，DAO代码。 1. 开 database explore，创建好mysql driver，名字随便起，我要用到一个bookstore的database，所以这里叫mySQ

2015-07-09 00:20:43 391

原创 20150708 lintcode 总结 Binary Tree Maximum Path Sum Show result *****

Medium Binary Tree Maximum Path Sum Show result 23% Accepted Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Example: Given th

2015-07-08 16:23:48 429

原创 20150708 lintcode 总结 Minimum Path Sum

Easy Minimum Path Sum Show result 34% Accepted Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numb

2015-07-08 15:09:06 390

原创 20150708 lintcode 总结 Binary Search Tree Iterator

Binary Search Tree Iterator Design an iterator over a binary search tree with the following rules: Elements are visited in ascending order (i.e. an in-order traversal)next() and hasNext(

2015-07-08 11:09:18 629

原创 20150707 lintcode 总结 Search Range in Binary Search Tree

Given two values k1 and k2 (where k1 Example If k1 = 10 and k2 = 22, then your function should return [12, 20, 22]. 20 / \ 8 22 / \ 4 12 /** * Definition of TreeNo

2015-07-07 12:02:42 504

原创 20150624 lintcode 总结 binary-tree-level-order-traversal **

Binary Tree Level Order Traversal http://www.lintcode.com/problem/binary-tree-level-order-traversal Given a binary tree, return the level order traversal of its nodes' values. (ie, from

2015-06-24 23:59:50 353

原创 20150624 lintcode 总结 Lowest Common Ancestor

Lowest Common Ancestor http://www.lintcode.com/problem/lowest-common-ancestor Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. T

2015-06-24 23:00:22 418

原创 20150624 lintcode 总结 Balanced Binary Tree

判断是否为balanced binary tree： http://www.lintcode.com/en/problem/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is

2015-06-24 13:31:22 531

原创 20150624 lintcode 总结 Validate Binary Search Tree

Validate Binary Search Tree 题目：http://www.lintcode.com/en/problem/validate-binary-search-tree/ Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is de

2015-06-24 00:11:56 551

原创 CC2530 Note 1:( ProcessEvent, MSGpkt, MessageMSGCB)

搞了半天CC2530 总算有点明白系统是怎么运行的了，jixil

2014-07-22 15:32:53 2128 1

u014748614的专栏