Pleasant sheep and big big wolfTime Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:304664-bit integer IO format:%I64...
分类:
其他好文 时间:
2014-11-13 20:37:40
阅读次数:
237
数据库字段:想要的结果:实际查询的结果:解决方法:使用CAST函数把varchar2转为int类型order by CAST(CODE AS INTEGER)
分类:
数据库 时间:
2014-11-13 16:12:01
阅读次数:
166
Frequency HoppingTime Limit: 10000msMemory Limit: 131072KBThis problem will be judged onUVA. Original ID:1124864-bit integer IO format:%lld Java class...
分类:
其他好文 时间:
2014-11-13 14:21:50
阅读次数:
276
DescriptionFor a positive integer N , the digit-sum of N is defined as the sum of N itself and its digits. When M is the digitsum of N , we call N a g...
分类:
其他好文 时间:
2014-11-13 12:48:57
阅读次数:
172
Liserious战队Time Limit:1000msMemory Limit:65536KB64-bit integer IO format:%lld Java class name:MainPrevSubmitStatusStatisticsDiscussNextFont Size:+-Typ...
分类:
其他好文 时间:
2014-11-13 12:43:13
阅读次数:
214
Justice StringTime Limit: 2000msMemory Limit: 65536KB64-bit integer IO format:%lld Java class name:MainGiven two strings A and B, your task is to find...
分类:
其他好文 时间:
2014-11-13 12:27:41
阅读次数:
99
我模仿lucene的BytesRef写了一个CharsRefIntHashMap,实测效果并不如HashMap。代码如下:
package com.dp.arts.lucenex.utils;
import org.apache.lucene.util.CharsRef;
public interface CharsRefIntMap
{
...
分类:
其他好文 时间:
2014-11-13 00:38:32
阅读次数:
267
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from ...
分类:
其他好文 时间:
2014-11-12 23:06:03
阅读次数:
255
问题描述:
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,...
分类:
其他好文 时间:
2014-11-12 15:06:18
阅读次数:
183
关键点:将List内存储的对象实现Comparable类,重写它的compareTo()方法即可
Bean:
package chc;
public class StuVo implements Comparable{
private String id;
private String name;
private Integer age;
public StuVo(String id,...
分类:
编程语言 时间:
2014-11-12 15:05:43
阅读次数:
207