- 博客(10)
- 资源 (10)
- 收藏
- 关注
RSS订阅原创 leetcode: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", return
2014-09-28 23:10:17
406
原创 leetcode:Word Search
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically n
2014-09-28 00:12:07
420
原创 leetcode:Construct Binary Tree from Preorder and Inorder Traversal
简单的递归题目,给出zhongxu
2014-09-21 23:39:13
448
原创 leetcode: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 \
2014-09-18 23:30:05
452
原创 hihcoder:补提交卡
1051 : 补提交卡 时间限制:2000ms 单点时限:1000ms 内存限制:256MB 描述 小Ho给自己定了一个宏伟的目标：连续100天每天坚持在hihoCoder上提交一个程序。100天过去了，小Ho查看自己的提交记录发现有N天因为贪玩忘记提交了。于是小Ho软磨硬泡、强忍着小Hi鄙视的眼神从小Hi那里要来M张"补提交卡"。每张"补提交卡"
2014-09-18 15:11:14
1355
3
原创 leetcode：Search in Rotated Sorted Array
public class Solution { public static void main(String[] args){ //[4,5,6,7,0,1,2], 0 int[] arr = {4,5,6,7,0,1,2}; int target = 0; System.out.println(new Solution().search(ar
2014-09-16 10:53:26
433
原创 自己实现的线程池
import java.util.*; public class MyThreadPool{ private LinkedList taskList ; private ArrayList threadList; private boolean flag = false; private volatile boolean threadRun = true; private int
2014-09-02 00:48:33
537
原创 hihocoder:完全背包
时间限制:20000ms 单点时限:1000ms 内存限制:256MB 描述 且说之前的故事里，小Hi和小Ho费劲心思终于拿到了茫茫多的奖券！而现在，终于到了小Ho领取奖励的时刻了！ 等等，这段故事为何似曾相识？这就要从平行宇宙理论说起了………总而言之，在另一个宇宙中，小Ho面临的问题发生了细微的变化！ 小Ho现在手上有M张奖券，而奖品区有N种奖品，分别标号为1到N
2014-09-02 00:10:13
436
axis2与spring集成
2015-05-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人