zoukankan      html  css  js  c++  java
  • 笔记


      /*String hexString = Integer.toHexString((byte) bytes[2] & 0x00FF);
         String string = new BigInteger(hexString,16).toString();
         Integer wifiHotCount = Integer.valueOf(string);
      //获取wifi热点数据
        for (int i = 1; i <= wifiHotCount; i++) {
        for (int j = 0; j < 7; j++) {
         if (Integer.toHexString(bytes[s] & 0x00FF).length() == 1) {
          if (j != 6)
           wifiHot += "0" + Integer.toHexString(bytes[s] & 0x00FF) + ":";
          if (j == 6) {
           wifiHot = wifiHot.substring(0, wifiHot.length() - 1);
           wifiHot += "," + Integer.toHexString(bytes[s] & 0x00FF)+";";
          }
          s = s + 1;
         } else {
          if (j != 6)
           wifiHot += Integer.toHexString(bytes[s] & 0x00FF) + ":";
          if (j == 6) {
           wifiHot = wifiHot.substring(0, wifiHot.length() - 1);
           wifiHot += "," + Integer.toHexString(bytes[s] & 0x00FF)+";";
          }
          s = s + 1;
         }
     
        }
       //String kString=wifiHot;
       //wifiHot="";
       // System.out.println(kString);
      }*/
     /*  wl = wifiHot.substring(0, wifiHot.length() - 1);
       //获取mccmnc对应的十进制数
       int mccmncStart=10+(wifiHotCount-1)*7+8;
       int i=mccmncStart;
       String mcc="";
       String mnc="";
       while(i<=mccmncStart+1){
        if(Integer.toHexString(bytes[i] & 0x00FF).length()==1){
         mcc +="0"+Integer.toHexString(bytes[i] & 0x00FF);
             }
        else{mcc+=Integer.toHexString(bytes[i] & 0x00FF);}
       i++;
       }
       mcc=new BigInteger(mcc, 16).toString();//获取mcc对应的10进制数
       mnc=new BigInteger(Integer.toHexString(bytes[mccmncStart+2] & 0x00FF), 16).toString();//获取mnc对应的10进制数
      
      
      
      
      
      
       System.out.println(mcc);
       System.out.println(mnc);
    */
     

  • 相关阅读:
    POJ NOI0113-05 素数回文数的个数(PKU2928)
    POJ NOI0113-04 垂直直方图(PKU2800)
    POJ NOI0113-03 八进制小数(PKU2765)
    UVALive2245 POJ1131 HDU1376 ZOJ1086 Octal Fractions【进制】
    HDU2708 Vertical Histogram
    POJ2136 Vertical Histogram【打印图案】
    POJ2190 HDU2714 ISBN
    POJ NOI0113-02 不吉利日期(PKU2723)
    POJ NOI0113-01 数制转换(PKU2710)
    POJ NOI MATH-7828 最大公约数与最小公倍数
  • 原文地址:https://www.cnblogs.com/wth21-1314/p/7561113.html
Copyright © 2011-2022 走看看