俺的名字叫荆华
- 浏览: 10460 次
- 性别:
- 来自: 西安
-
最新评论
文章列表
Must Be a Reason Why...
Must be the reason why I'm king of my castle
Must be the reason why I'm freeing my trapped soul
Must be the reason why I'm king of my castle
Must be a reason why I'm making examples of you
First spotted in my mind
Not figuring where I'm at in my life
Only I could ever change i ...
shayne ward obsession歌词
- 博客分类：
- IT生活
Baby, baby
What can I do
I need to know, that
I belong, belong with you
Yea with you
Baby baby
What can I say
The more you play those wicked games,
The more I stay, the more I stay
Teacher be concerned, I want it so
Bad right now it hurts
Cause I, I, I'm more than in love
Baby I'm in obsession
I, I ...
判断数字是否为回文数字？
一个判断正整数是一个回文数的算法.所谓回文数是指左右数字完全对称的自然数.例如,121,12321,484,555.
算法思路：用取模和除法把数字翻转过来，然后判断是否和原来的数字相等。
public static boolean is(long m)
{
long i=m ,s=0;
while(i!=0)
{s=s*10+i%10;
i=i/10;}
return(s==m);
}
用递归方式判断字符串是否是回文算法
http://ork.iteye.com/blog/6 ...
select
cast ((A*100.00)/B as decimal(10,2)) as C
from tableName
10 代表了长度，
2 代表了2位小数
很简单，请使用这段代码：
<a href="#" onclick="window.opener=null;window.open('','_self');window.close();">不确认关闭 </a>
也就是在window.opener=null;window.close()之间加入window.open('','_self');
就OK了！
面试老考这个，都背熟了
public class BubbleSort
{
public static void main(String[] args){
int[] values ={
3,1,6,2,9,0,7,4,5
};
sort(values);
for(int i=0; i < values.length; ++i){
System.out.println(&qu ...