Link:http://oj.leetcode.com/problems/swap-nodes-in-pairs/Given a linked list,
swap every two adjacent nodes and return its head.For example,Given1->2-...
分类:
其他好文 时间:
2014-05-05 22:45:37
阅读次数:
331
本文使用xml来创建上下文菜单
orderInCategory属性为排列顺序MyActivity的布局: MyActivity.javapackage
com.example.contextMenuTest;import android.app.Activity;...
分类:
移动开发 时间:
2014-05-05 21:41:07
阅读次数:
445
Problem Description
Given an positive integer A (1
For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2.
Another example...
分类:
其他好文 时间:
2014-05-05 13:22:39
阅读次数:
394
apk file 其实就是zip文件, 可以将其重命名为zip文件,然后用unzip命令解压。unzip example1.apk -d ./example_dir
tree
.
├── AndroidManifest.xml
├── classes.dex
├── META-INF
│ ├── CERT.RSA
│ ├── CERT.SF
│ └── MANIFEST.MF
├── ...
分类:
移动开发 时间:
2014-05-05 13:12:59
阅读次数:
469
文件存储的用途:
A File object is suited to reading or writing large amounts of data in start-to-finish order without skipping around. For example, it's good for image files or anything exchanged over a netw...
分类:
移动开发 时间:
2014-05-05 13:01:21
阅读次数:
339
1、先上图后说话
2、代码
package com.example.exmp;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.os.Parcelable;
import android.support.v4.view.PagerAda...
分类:
移动开发 时间:
2014-05-04 18:43:02
阅读次数:
585
We consider permutations of the numbers 1,..., N
for some N. By permutation we mean a rearrangment of the
number 1,...,N. For example
2 4 5 1 7 6 3 8
is a permutation of 1,2,...,8. Of cours...
分类:
其他好文 时间:
2014-05-04 18:38:14
阅读次数:
341
Given a collection of numbers that might
contain duplicates, return all possible unique permutations.For
example,[1,1,2]have the following unique perm...
分类:
其他好文 时间:
2014-05-04 10:20:44
阅读次数:
240
Input
t – the number of numbers in list, then t lines follow [t
Each line contains one integer: N [0 N
Output
Output given numbers in non decreasing order.
Example
Input:
5
5
3
...
分类:
其他好文 时间:
2014-05-04 00:04:09
阅读次数:
376
把一般式子转换成逆波兰式。
这里的都是加括号的,难度降低点。
Example
Input:
3
(a+(b*c))
((a+b)*(z+x))
((a+t)*((b+(a+c))^(c+d)))
Output:
abc*+
ab+zx+*
at+bac++cd+^*
知道其特点就好办:
1 遇到字母一定是可以输出的
2 遇到操作符号就入栈
3 遇到括号')',就出栈...
分类:
其他好文 时间:
2014-05-03 15:35:28
阅读次数:
317