摘要:
折半查找法 代码 public static int bin_Search(int array[],int key){ int mid,high,low=0; high = array.length-1; while(low<=high){ mid=(low+high)/2; if(array[mi 阅读全文
posted @ 2017-10-22 17:10
PrivateO2
阅读(231)
评论(0)
推荐(0)
摘要:
String的常见操作(面试题) 将字符串逆序输出 public static String inverse(String str ){ char chars[] = str.toCharArray(); for(int i=0;i<chars.length/2;i++){ char temp = 阅读全文
posted @ 2017-10-22 17:09
PrivateO2
阅读(337)
评论(0)
推荐(0)