这里只是把解析的数据当日志打出来了 非常简单的xml解析方式 1 package
com.example.demo.service; 2 3 import java.io.IOException; 4 import
java.io.InputStream; 5 6 import ...
分类:
其他好文 时间:
2014-05-23 04:12:53
阅读次数:
308
Reverse a linked list from positionmton. Do it
in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m=
2 andn= 4,return1->4->3->2->5->NULL.No...
分类:
其他好文 时间:
2014-05-21 19:08:08
阅读次数:
195
安装环境:Fedora16,用户名guge软件包:grads-2.0.1-bin-i686-pc-linux-gnu.tar.gz(grads主程序),
data2.tar.gz(grads自带字体、地图包), example.tar.Z(样例测试包)(以上软件包从http://www.iges.....
分类:
系统相关 时间:
2014-05-21 18:11:08
阅读次数:
412
Given a sorted linked list, delete all nodes
that have duplicate numbers, leaving onlydistinctnumbers from the original
list.For example,Given1->2->3-...
分类:
其他好文 时间:
2014-05-21 17:51:09
阅读次数:
190
【题目】
Given an unsorted integer array, find the first missing positive integer.
For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.
Your algorithm should run in O(n) time and uses constant space.
【题意】
给定一个数组,找出第一个缺失的正数。时间复杂度O(n)
...
分类:
其他好文 时间:
2014-05-21 17:13:07
阅读次数:
219
参考别人的code, 看似不难的题,其实挺费事的。思想还是:From this example, we
can see that in the first position of the resulting combinations we can chose
number 1-5. Assume t...
分类:
其他好文 时间:
2014-05-21 14:24:04
阅读次数:
241
Description
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn ? 1 + Fn ? 2 for n ≥ 2. For example, the first ten terms of
the Fibonacci sequence are:
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
分类:
其他好文 时间:
2014-05-21 09:39:15
阅读次数:
231
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, n satisfy the fol...
分类:
其他好文 时间:
2014-05-21 07:18:02
阅读次数:
301
【题目】
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.
The above elevation map is represente...
分类:
移动开发 时间:
2014-05-21 06:44:38
阅读次数:
359
DescriptionA rooted tree is a well-known data
structure in computer science and engineering. An example is shown below:In the
figure, each node is lab...
分类:
其他好文 时间:
2014-05-21 03:23:51
阅读次数:
296