zoukankan      html  css  js  c++  java
  • [ZZ]byte[]到short、int、long的相互转换

    public final static byte[] getBytes(short s, boolean asc) 
    {
    	byte[] buf = new byte[2];
    	if (asc)
    		for (int i = buf.length - 1; i >= 0; i--) 
    		{
    			buf[i] = (byte) (s & 0x00ff);
    		  s >>= 8;
    		}
    	else
    		for (int i = 0; i < buf.length; i++) 
    		{
    			buf[i] = (byte) (s & 0x00ff);
    		  s >>= 8;
    		}
    	return buf;
    }
    
    public final static byte[] getBytes(int s, boolean asc) 
    {
    	byte[] buf = new byte[4];
    	if (asc)
    	  for (int i = buf.length - 1; i >= 0; i--) 
    	  {
    	    buf[i] = (byte) (s & 0x000000ff);
    	    s >>= 8;
    	  }
    	else
    	  for (int i = 0; i < buf.length; i++)
    	  {
    	    buf[i] = (byte) (s & 0x000000ff);
    	    s >>= 8;
    	  }
    	return buf;
    }
    
    public final static byte[] getBytes(long s, boolean asc) 
    {
    	byte[] buf = new byte[8];
    	if (asc)
    	  for (int i = buf.length - 1; i >= 0; i--) 
    		{
    	    buf[i] = (byte) (s & 0x00000000000000ff);
    	    s >>= 8;
    	  }
    	else
    	  for (int i = 0; i < buf.length; i++) 
    		{
    	    buf[i] = (byte) (s & 0x00000000000000ff);
    	    s >>= 8;
    	  }
    	return buf;
    }
    
    public final static short getShort(byte[] buf, boolean asc) 
    {
    	if (buf == null) 
    	{
    	  throw new IllegalArgumentException("byte array is null!");
    	}
    	if (buf.length > 2) 
    	{
    	  throw new IllegalArgumentException("byte array size > 2 !");
    	}
    	short r = 0;
    	if (asc)
    	  for (int i = buf.length - 1; i >= 0; i--) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x00ff);
    	  }
    	else
    	  for (int i = 0; i < buf.length; i++) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x00ff);
    	  }
    	return r;
    }
    
    public final static int getInt(byte[] buf, boolean asc) 
    {
    	if (buf == null) 
    	{
    	  throw new IllegalArgumentException("byte array is null!");
    	}
    	if (buf.length > 4) 
    	{
    	  throw new IllegalArgumentException("byte array size > 4 !");
    	}
    	int r = 0;
    	if (asc)
    	  for (int i = buf.length - 1; i >= 0; i--) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x000000ff);
    	  }
    	else
    	  for (int i = 0; i < buf.length; i++) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x000000ff);
    	  }
    	return r;
    }
    
    public final static long getLong(byte[] buf, boolean asc) 
    {
    	if (buf == null) 
    	{
    	  throw new IllegalArgumentException("byte array is null!");
    	}
    	if (buf.length > 8) 
    	{
    	  throw new IllegalArgumentException("byte array size > 8 !");
    	}
    	long r = 0;
    	if (asc)
    	  for (int i = buf.length - 1; i >= 0; i--) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x00000000000000ff);
    	  }
    	else
    	  for (int i = 0; i < buf.length; i++) 
    		{
    	    r <<= 8;
    	    r |= (buf[i] & 0x00000000000000ff);
    	  }
    	return r;
    }
    

  • 相关阅读:
    Leetcode 乘积最大子数组 (两种思路)
    C++string函数库-->to_string
    Zigzags CodeForces
    石子游戏(Leetcode每日一题)
    树形dp入门题(Leetcode 337. 打家劫舍 III)
    E
    背包九讲
    通过树状dp来求树的直径
    329. 矩阵中的最长递增路径(Leetcode每日一题)
    关于图的匹配,边覆盖,独立集,顶点覆盖
  • 原文地址:https://www.cnblogs.com/pegasus923/p/1845866.html
Copyright © 2011-2022 走看看