Guest User

Untitled

a guest
Jan 17th, 2018
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.97 KB | None | 0 0
  1. public static void main(String[] args){
  2.  
  3. String maxAmpStr = Integer.toBinaryString(8);
  4. char[] arr = maxAmpStr.toCharArray();
  5. boolean[] binaryarray = new boolean[7];
  6. for (int i=0; i<maxAmpStr.length(); i++){
  7. if (arr[i] == '1'){
  8. binaryarray[i] = true;
  9. }
  10. else if (arr[i] == '0'){
  11. binaryarray[i] = false;
  12. }
  13. }
  14.  
  15. System.out.println(maxAmpStr);
  16. System.out.println(binaryarray[0]);
  17. System.out.println(binaryarray[1]);
  18. System.out.println(binaryarray[2]);
  19. System.out.println(binaryarray[3]);
  20. System.out.println(binaryarray[4]);
  21. System.out.println(binaryarray[5]);
  22. System.out.println(binaryarray[6]);
  23. }
  24.  
  25. public static void main(String[] args) {
  26.  
  27. int input = 15;
  28.  
  29. boolean[] bits = new boolean[7];
  30. for (int i = 6; i >= 0; i--) {
  31. bits[i] = (input & (1 << i)) != 0;
  32. }
  33.  
  34. System.out.println(input + " = " + Arrays.toString(bits));
  35. }
  36.  
  37. private static boolean[] toBinary(int number, int base) {
  38. final boolean[] ret = new boolean[base];
  39. for (int i = 0; i < base; i++) {
  40. ret[base - 1 - i] = (1 << i & number) != 0;
  41. }
  42. return ret;
  43. }
  44.  
  45. for (int i=0; i<maxAmpStr.length(); i++)
  46. {
  47. if (arr[i] == '1')
  48. {
  49. binaryarray[i+maxAmpStr.length()-1] = true;
  50. }
  51. else if (arr[i] == '0')
  52. {
  53. binaryarray[i+maxAmpStr.length()-1] = false;
  54. }
  55. }
  56.  
  57. public static boolean[] convertToBinary(int b){
  58. boolean[] binArray = new boolean[7];
  59. boolean bin;
  60. for(int i = 6; i >= 0; i--) {
  61. if (b%2 == 1) bin = true;
  62. else bin = false;
  63. binArray[i] = bin;
  64. b/=2;
  65. }
  66. return binArray;
  67. }
  68.  
  69. public static boolean[] convertToBinary(int number) {
  70. int binExpo = 0;
  71. int bin = 1;
  72. while(bin < number) { //calculates the needed digits
  73. bin = bin*2;
  74. binExpo++;
  75. }
  76. bin = bin/2;
  77. boolean[] binary = new boolean[binExpo]; //array with the right length
  78. binExpo--;
  79. while(binExpo>=0) {
  80. if(bin<=number) {
  81. binary[binExpo] = true;
  82. number =number -bin;
  83. bin = bin/2;
  84. }else {
  85. binary[binExpo] = false;
  86. }
  87. binExpo--;
  88. }
  89. return binary;
  90. }
  91.  
  92. public static String intToBinary(int num) {
  93. int copy = num;
  94. String sb = "";
  95. for(int i=30; i>=0; i--) {
  96. sb = (copy&1) + sb;
  97. copy = copy >>>=1;
  98. }
  99. return sb;
  100. }
  101.  
  102. String maxAmpStr = Integer.toBinaryString(255);
  103. char[] arr = maxAmpStr.toCharArray();
  104. boolean[] binaryarray = new boolean[20];
  105. int pivot = binaryarray.length - arr.length;
  106. int j = binaryarray.length - 1;
  107. for (int i = arr.length - 1; i >= 0; i--) {
  108. if (arr[i] == '1') {
  109. binaryarray[j] = true;
  110. } else if (arr[i] == '0') {
  111. binaryarray[j] = false;
  112. }
  113. if (j >= pivot)
  114. j--;
  115. }
  116.  
  117. System.out.println(maxAmpStr);
  118. for (int k = 0; k < binaryarray.length; k++)
  119. System.out.println(binaryarray[k]);
  120. }
Add Comment
Please, Sign In to add comment