小技巧
来源:互联网 发布:win8制作mac启动盘 编辑:程序博客网 时间:2024/06/13 11:11
/**
*怎么用for循环计算数组最大值
*@paramargs
*/
publicstaticvoid main(String[] args) {
int score[] = { 67, 89, 87,69, 90, 100, 75, 90 };// 静态初始化数组
int max = 0;// 定义变量保存最大值
int min = 0;// 定义变量保存最小值
max = min = score[0]; // 把第一个元素的内容赋值给max或min
for (int x = 0; x < score.length; x++) { // 循环求出最大和最小
if (score[x] > max) {// 依次判断后续元素是否比max大
max = score[x]; // 如果大,则修改max内容
}
if (score[x] < min) {// 依次判断后续元素是否比min小
min = score[x]; // 如果小,则修改min内容
}
}
System.out.println("最高成绩:" + max);// 输出最大值
System.out.println("最低成绩:" + min);// 输出最小值
}
/**
*循环取出最大值最小值
*@paramargs
*/
publicstaticvoid main(String[] args) {
int[] all = { 1, 4222222, 8,2, 12, 55, 30 };
int max = all[0];//将第一个设为最大值
int min = all[0];//将第一个设为最大值
for (int i = 1; i < all.length; i++) {
max = all[i] > max ? all[i] : max;//从第二值开始比较;如果大于max此时max=当时值;
min = all[i] < min ? all[i] : min;//从第二值开始比较;如果大于max此时max=当时值;
}
System.out.println("最大值:" + max);
System.out.println("最小值:" + min);
}
/**
*冒泡排序
*@paramargs
*/
publicstaticvoid main(String[] args) {
int[] myArray =newint[] { 10, 811, 3, 5, 6, 7, 4, 6, 9 };
// 取长度最长的词组 -- 冒泡法
for (int j = 1; j < myArray.length;j++)
{
for (int i = 0; i < myArray.length - 1; i++)
{
// 如果myArray[i] > myArray[i+1] ,则 myArray[i] 上浮一位
if (myArray[i] >myArray[i + 1])
{
int temp = myArray[i];
myArray[i] = myArray[i + 1];
myArray[i + 1] = temp;
}
}
}
for (int i = 0; i < myArray.length; i++) {
System.out.println(myArray[i]);
}
}
//过滤重复
publicstaticvoid main(String[] args) {
List<String> list1 = new ArrayList<String>();
list1.add("23");
list1.add("231");
list1.add("232");
list1.add("233");
list1.add("234");
list1.add("235");
list1.add("236");
List<String> list2 = new ArrayList<String>();
list2.add("1");
list2.add("2");
String a="";
for (int i = 0; i < list1.size(); i++) {
for (int j = 0; j < list2.size(); j++) {
if(a.indexOf(list2.get(j))==-1){
a+=list2.get(j)+",";
System.out.println(list2.get(j));
}
}
}
}
List list = new ArrayList();//假设里面已经有abcde
list.add("a");
list.add("b");
list.add("c");
list.add("e");
List<ArrayList> group = newArrayList<ArrayList>();
int groupCount = 3;//每组的数量
for(int i=0 ; i<list.size(); i++){
// 获取当前分组存储对象
ArrayList currentGroupArray;
if (i % groupCount == 0){
currentGroupArray = new ArrayList();
group.add(currentGroupArray );
} else {
currentGroupArray =group.get(group.size() - 1 );
}
//将当前的值填入到分组中
currentGroupArray.add(list.get(i));
}
publicstaticvoid main(String[] args){
int[] sum={1,4,2,3,6,7,8,11,10,20};
Arrays.sort(sum);
for(int i = 0;i<sum.length;i++){
System.out.println(sum[i]);
}
}
publicstaticvoid main(String[] args){
/****MAP排序*******/
TreeMap<String,String>treeMap = new TreeMap();
treeMap.put("4","zhangsan");
treeMap.put("3","lisi");
treeMap.put("2","wangwu");
treeMap.put("5","xiaohong");
Set<java.util.Map.Entry<String,String>> entry = treeMap.entrySet();
for(Iterator<java.util.Map.Entry<String,String>> it =entry.iterator();it.hasNext();) {
java.util.Map.Entry<String,String> entry2 = it.next();
System.out.println("KEY:"+entry2.getKey()+" "+"VALUE:"+entry2.getValue());
}
}
//java中怎么删除数组中的元素
publicstaticvoid main(String[] args) {
Object[] a= new Object[1];
a[0]="111-1";
Object[] b= new Object[1];
b[0]="2222-2";
Object[] c= new Object[1];
c[0]="333-3";
List<Object[]> nullCar_objList = newArrayList<Object[]>();
nullCar_objList.add(a);
nullCar_objList.add(b);
nullCar_objList.add(c);
ss(nullCar_objList);
}
privatestaticvoid ss(List<Object[]> l){
System.out.println("值:"+l.get(0)[0]);
l.remove(0);
System.out.println("====list还剩元素"+l.size());
for (Object[] objects : l) {
System.out.println(objects[0]);
}
if (l.size() != 0) {
ss(l);
}
}
//分组
publicstaticvoid main(String[] args) {
String all[] ={"1","2","3","4","5","6","7","8","9"};
int count = 5;
List<List<String>> aa = new ArrayList<List<String>>();
List<String> temp = new ArrayList<String>();
for (int i = 0; i < all.length; i++) {
int tempnum = all.length-i;
if(count>(tempnum)){
count=tempnum;
}
temp.add(all[i]);
if(count!=0){
count--;
}
if(count==0){
aa.add(temp);
temp = new ArrayList<String>();
count=5;
}
}
for (int i = 0; i < aa.size(); i++) {
System.out.println("第"+(i+1)+"组:");
for (int j = 0; j < aa.get(i).size(); j++) {
System.out.println(aa.get(i).get(j));
}
}
}
/**
*后台解析JSON形式
*
*@paramargs
*@throwsException
*/
publicstaticvoid main(String[]args)throws Exception {
String json = "{\"1293142@1098820@1211867_1083940_1293396_1148650\":[{\"FS_ID\":\"1293396\",\"SX_MC\":\"李四\",\"YFS_ID\":\"1293142\",\"SZ_ID\":\"1148650\",\"SX_Z\":\"803932\"}],\"1293142@1098820@1211867_1083940_1293396_1097084\":[{\"FS_ID\":\"1293396\",\"SX_MC\":\"李四\",\"YFS_ID\":\"1293142@1084106@1103027\",\"SZ_ID\":\"1097084\",\"SX_Z\":\"124\"}],\"1293142@1098820@1211867_1083940_1293331_1148650\":[{\"FS_ID\":\"1293331\",\"SX_MC\":\"张三\",\"YFS_ID\":\"1293142\",\"SZ_ID\":\"1148650\",\"SX_Z\":\"1005240\"}],\"1293142@1098820@1211867_1083940_1293331_1097084\":[{\"FS_ID\":\"1293331\",\"SX_MC\":\"张三\",\"YFS_ID\":\"1293142@1084106@1103027\",\"SZ_ID\":\"1097084\",\"SX_Z\":\"204\"}],\"1293142@1098820@1211867_1083940_1284806_1148650\":[{\"FS_ID\":\"1284806\",\"SX_MC\":\"王小二\",\"YFS_ID\":\"1293142\",\"SZ_ID\":\"1148650\",\"SX_Z\":\"513475\"}],\"1293142@1098820@1211867_1083940_1284806_1097084\":[{\"FS_ID\":\"1284806\",\"SX_MC\":\"王小二\",\"YFS_ID\":\"1293142@1084106@1103027\",\"SZ_ID\":\"1097084\",\"SX_Z\":\"145\"}],\"1293142@1098820@1211867_1083940_1293461_1148650\":[{\"FS_ID\":\"1293461\",\"SX_MC\":\"朱重八\",\"YFS_ID\":\"1293142\",\"SZ_ID\":\"1148650\",\"SX_Z\":\"339040\"}],\"1293142@1098820@1211867_1083940_1293461_1097084\":[{\"FS_ID\":\"1293461\",\"SX_MC\":\"朱重八\",\"YFS_ID\":\"1293142@1084106@1103027\",\"SZ_ID\":\"1097084\",\"SX_Z\":\"52\"}]}";
JSONObject iObj = new JSONObject(json);
//<1>迭代器的获取KEY
// Iterator it = iObj.keys();
// while (it.hasNext()) {
// String str = it.next().toString();
// System.out.println(str);
// }
//<2>SET获取KEY
Set<String> set= iObj.keySet();
for (String str : set) {
JSONArray array = new JSONArray(StrUtil.getStringUtil(iObj.get(str)));
for (int i = 0; i < array.length(); i++) {
JSONObject jons = array.getJSONObject(i);
System.out.println(jons.get("SX_MC"));
}
}
}
找数字
<script type="text/javascript">
//将数字的拼凑出
var array ="3848657_1046218@222@111_9048_";
var obj=new Array();
var htmls="";
for(vari=0;i<array.length;i++){
if(!isNaN(array.charAt(i))){
obj.push(array.charAt(i));
}else{
//每次找出的数字 obj.join("")
htmls+=obj.join("")+array.charAt(i)
obj = new Array();
}
}
alert(htmls)
</script>
/**
*@ms:根据字段的原始值找到对应的新值,处理后返回(根据旧值找新值)
*@param:keyArray字段集合
*@param:dataArray数据集合
*@param:startCount执行次数
*@author:ZhangZhi张智
*@date:2013-7-520:39:51 创建时间
**/
functionreplacePastAndNewData(keyArray,dataArray,startCount){
if(dataArray.length ==0 || keyArray.length ==0){
return dataArray;
}
startCount=startCount==undefined?99999999:startCount;
varTSFH_FINAL24=$("#TSFH_FINAL24").val();
varresultArray = newArray();
for(vari=0;i<dataArray.length;i++){
var objJson=dataArray[i];
for(varj=0;j<keyArray.length;j++){
var key=keyArray[j];
varvalue =objJson[key];
varnewValueArray = newArray();
vartermValueArray=newArray();//存放原始数值条件
if(value!=""&& value!=undefined){//若找出的值不为空,则执行如下
value=value+TSFH_FINAL24;//给值后面随便拼凑一个特殊符号
varobj=new Array();
vars=0;
for(vark=0;k<value.length;k++){//遍历值字符串
varcharValue=value.charAt(k);//获取CHAR值
if(!isNaN(charValue)){//验证是否为数字
obj.push(charValue);//拼凑数字
}else{
//取出拼凑数值的,间隔符号前的数值值
vartermValue=obj.join("");//每次找出并拼凑的数字 obj.join("")
varnewValue="";
if(s<startCount){//找值
s++;
$("#copyFormulaDxData ").each(function(){
newValue=$(this).children("input[id='"+termValue+"'][name='copyFormulaDxData']").val();
newValue=newValue==undefined?"":newValue;
if(newValue!=""){
returnfalse;
}
});
newValue=newValue==""?termValue:newValue;
newValueArray.push((newValue+charValue));
termValueArray.push((termValue+charValue));
obj =new Array();
}else{//达到限定循环次数的循环上限,则停止
varstopValue=strSub(value, termValueArray.join(""), 1, -1);//停止截取后剩下的值
vartemp=newValueArray.join("")+stopValue;
newValueArray =new Array();
newValueArray.push(temp);
break;
}
}
}
}
newValueArray=newValueArray.join("");
newValueArray=newValueArray.substring(0,newValueArray.lastIndexOf(TSFH_FINAL24));
objJson[key]=newValueArray;
}
resultArray.push(objJson);
}
alert(JSON.stringify(resultArray))
returnresultArray;
}
importjava.text.DateFormat;
importjava.text.SimpleDateFormat;
importjava.util.Date;
/**
* @sm 时间差
* @author Administrator
*
*/
public class SJ{
/**
*@param args
*/
public static void main(String[] args) {
DateFormat df = newSimpleDateFormat("yyyy-MM-dd HH:mm:ss");
try {
Date d1 = df.parse("2013-3-210:12:36");
Date d2 = df.parse("2013-2-110:12:41");
long diff = d1.getTime() -d2.getTime();
long days = diff / (1000 * 60 * 60 *24);
System.out.println(days);
getTime();
} catch (Exception e) {
}
}
public static void getTime() {
try {
SimpleDateFormat df = newSimpleDateFormat("yyyy-MM-dd HH:mm:ss");
java.util.Date now =df.parse("2013-3-1 10:16:23");
java.util.Date date =df.parse("2013-3-1 10:16:27");
long l = now.getTime() -date.getTime();
long day = l / (24 * 60 * 60 * 1000);
long hour = (l / (60 * 60 * 1000) -day * 24);
long min = ((l / (60 * 1000)) - day *24 * 60 - hour * 60);
long s = (l / 1000 - day * 24 * 60 *60 - hour * 60 * 60 - min * 60);
System.out.println("" + day+ "天" + hour + "小时" + min + "分" + s + "秒");
} catch (Exception e) {
// TODO: handle exception
}
}
}
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧:
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- 小技巧
- Spark学习之9:Shuffle Write
- Scroller解析
- VS常用快捷键一览表
- 判定ctrl 键是否被按下
- [SpringMVC]unresolved dependency rg.springframework.boot:spring-boot-starter-web:1.2.3.RELEASE
- 小技巧
- Linux用户空间线程管理介绍之一
- 如何在Excel或sqlserver中写用户函数实现数字货币向英文转换集锦
- c#数据库连接技术
- 在Eclipse中使用JUnit4进行单元测试(初级篇)
- Fence Repair
- mysql 数据迁移失败原因总结
- jquery.validate使用攻略
- 让多个Fragment 切换时不重新实例化