GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Conversions/AnyBaseToAnyBase.java at master · HelloWorldsir/Java Expand file tree/ Copy pathAnyBaseToAnyBase.javaMore file actions 130 lines (120 loc) · 4.19 KB / Copy pathAnyBaseToAnyBase.javaFile metadata and controls130 lines (120 loc) · 4.19 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 import java.util.Arrays; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Scanner; /** * Class for converting from "any" base to "any" other base, when "any" means from 2-36. * Works by going from base 1 to decimal to base 2. Includes auxiliary method for * determining whether a number is valid for a given base. * * @author Michael Rolland * @version 2017.10.10 * */ public class AnyBaseToAnyBase { // Smallest and largest base you want to accept as valid input static final int MINIMUM_BASE = 2; static final int MAXIMUM_BASE = 36; // Driver public static void main(String[] args) { Scanner in = new Scanner(System.in); String n; int b1=0,b2=0; while (true) { try { System.out.print("Enter number: "); n = in.next(); System.out.print("Enter beginning base (between "+MINIMUM_BASE+" and "+MAXIMUM_BASE+"): "); b1 = in.nextInt(); if (b1 > MAXIMUM_BASE || b1 < MINIMUM_BASE) { System.out.println("Invalid base!"); continue; } if (!validForBase(n, b1)) { System.out.println("The number is invalid for this base!"); continue; } System.out.print("Enter end base (between "+MINIMUM_BASE+" and "+MAXIMUM_BASE+"): "); b2 = in.nextInt(); if (b2 > MAXIMUM_BASE || b2 < MINIMUM_BASE) { System.out.println("Invalid base!"); continue; } break; } catch (InputMismatchException e) { System.out.println("Invalid input."); in.next(); } } System.out.println(base2base(n, b1, b2)); } /** * Checks if a number (as a String) is valid for a given base. */ public static boolean validForBase(String n, int base) { char[] validDigits = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; // digitsForBase contains all the valid digits for the base given char[] digitsForBase = Arrays.copyOfRange(validDigits, 0, base); // Convert character array into set for convenience of contains() method HashSet<Character> digitsList = new HashSet(); for (int i=0; i<digitsForBase.length; i++) digitsList.add(digitsForBase[i]); // Check that every digit in n is within the list of valid digits for that base. for (char c : n.toCharArray()) if (!digitsList.contains(c)) return false; return true; } /** * Method to convert any integer from base b1 to base b2. Works by converting from b1 to decimal, * then decimal to b2. * @param n The integer to be converted. * @param b1 Beginning base. * @param b2 End base. * @return n in base b2. */ public static String base2base(String n, int b1, int b2) { // Declare variables: decimal value of n, // character of base b1, character of base b2, // and the string that will be returned. int decimalValue = 0, charB2; char charB1; String output=""; // Go through every character of n for (int i=0; i<n.length(); i++) { // store the character in charB1 charB1 = n.charAt(i); // if it is a non-number, convert it to a decimal value >9 and store it in charB2 if (charB1 >= 'A' && charB1 <= 'Z') charB2 = 10 + (charB1 - 'A'); // Else, store the integer value in charB2 else charB2 = charB1 - '0'; // Convert the digit to decimal and add it to the // decimalValue of n decimalValue = decimalValue * b1 + charB2; } // Converting the decimal value to base b2: // A number is converted from decimal to another base // by continuously dividing by the base and recording // the remainder until the quotient is zero. The number in the // new base is the remainders, with the last remainder // being the left-most digit. // While the quotient is NOT zero: while (decimalValue != 0) { // If the remainder is a digit < 10, simply add it to // the left side of the new number. if (decimalValue % b2 < 10) output = Integer.toString(decimalValue % b2) + output; // If the remainder is >= 10, add a character with the // corresponding value to the new number. (A = 10, B = 11, C = 12, ...) else output = (char)((decimalValue % b2)+55) + output; // Divide by the new base again decimalValue /= b2; } return output; } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |