- 博客(13)
- 资源 (3)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 598. Range Addition II
Given an m * n matrix M initialized with all 0's and several update operations. Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a
2017-05-30 21:57:23
387
原创 114. Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \
2017-05-30 21:31:53
341
原创 198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent house
2017-05-30 15:19:51
172
原创 59. Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example, Given n = 3, You should return the following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [
2017-05-28 23:26:52
190
原创 61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. 题意：将列表右边的k个元素旋转到链表前面。 需要注意的一
2017-05-28 21:40:51
177
原创 123. Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You ma
2017-05-26 13:55:50
214
原创 121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
2017-05-26 12:34:54
226
原创 120. Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2], [3,4], [
2017-05-25 19:59:29
188
原创 115. Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from the original string by deleting some (can be non
2017-05-25 16:42:34
313
原创 97. Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = "aabcc", s2 = "dbbca", When s3 = "aadbbcbcac", return true. When s3 = "aadbbbaccc", r
2017-05-24 16:00:53
166
原创 96. Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n? 题意：给定整数n，计算出这1~n个整数能组成多少二叉查找树。 此题要做的事情跟上一题是一样的，只是要求的内容不同。大家可以先参考我上一题的思路 点击打开链接 利用上一题的方法中得到的List求size就
2017-05-23 21:12:48
222
原创 95. Unique Binary Search Trees II
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. 题意：给定一个数n，求1~n所组成的所有二叉查找树，并将树的根节点存储在List 中返回；
2017-05-23 10:58:45
305
原创 进程通信
进程通信是指进程之间的信息交换，进程之间的互斥和同步，由于其所交换的信息量少而被归结于低级通信。 本文介绍高级进程通信：用户可以直接利用操作系统提供的通信命令高效地传送大量数据的一种通信方式； 主要分为3种类型： 1、共享存储器系统 相互通信的进程共享某些数据结构或者共享存储区，进程之间通过这些空间进行通信； 2、消息传递系统 进程间的数据交换是以格式化的消息为单位的。程序员利用操作系
2017-05-16 16:53:13
394
MyBatis中怎么读取count值
2017-09-07
MyBatis通过xml文件配置DAO层Mapper出错
2017-08-27
TA创建的收藏夹 TA关注的收藏夹
TA关注的人