Guest User

Untitled

a guest
Jan 22nd, 2019
106
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 9.46 KB | None | 0 0
  1. int number; // = some int
  2.  
  3. while (number > 0) {
  4. print( number % 10);
  5. number = number / 10;
  6. }
  7.  
  8. 10012 % 10 = 2
  9.  
  10. 10012 / 10 = 1001, remainder 2
  11.  
  12. int number; // = and int
  13. LinkedList<Integer> stack = new LinkedList<Integer>();
  14. while (number > 0) {
  15. stack.push( number % 10 );
  16. number = number / 10;
  17. }
  18.  
  19. while (!stack.isEmpty()) {
  20. print(stack.pop());
  21. }
  22.  
  23. String number = String.valueOf(someInt);
  24.  
  25. char[] digits1 = number.toCharArray();
  26. // or:
  27. String[] digits2 = number.split("(?<=.)");
  28.  
  29. IntStream chars = number.chars();
  30.  
  31. public static void printDigits(int num) {
  32. if(num / 10 > 0) {
  33. printDigits(num / 10);
  34. }
  35. System.out.printf("%d ", num % 10);
  36. }
  37.  
  38. public static void main(String[] args) {
  39. Integer[] digits = getDigits(12345);
  40. System.out.println(Arrays.toString(digits));
  41. }
  42.  
  43. public static Integer[] getDigits(int num) {
  44. List<Integer> digits = new ArrayList<Integer>();
  45. collectDigits(num, digits);
  46. return digits.toArray(new Integer[]{});
  47. }
  48.  
  49. private static void collectDigits(int num, List<Integer> digits) {
  50. if(num / 10 > 0) {
  51. collectDigits(num / 10, digits);
  52. }
  53. digits.add(num % 10);
  54. }
  55.  
  56. int num = 5542;
  57. String number = String.valueOf(num);
  58. for(int i = 0; i < number.length(); i++) {
  59. int j = Character.digit(number.charAt(i), 10);
  60. System.out.println("digit: " + j);
  61. }
  62.  
  63. digit: 5
  64. digit: 5
  65. digit: 4
  66. digit: 2
  67.  
  68. // could be any num this is a randomly generated one
  69. int num = (int) (Math.random() * 1000);
  70.  
  71. // this will return each number to a int variable
  72. int num1 = num % 10;
  73. int num2 = num / 10 % 10;
  74. int num3 = num /100 % 10;
  75.  
  76. // you could continue this pattern for 4,5,6 digit numbers
  77. // dont need to print you could then use the new int values man other ways
  78. System.out.print(num1);
  79. System.out.print("n" + num2);
  80. System.out.print("n" + num3);
  81.  
  82. int[] intTab = String.valueOf(number).chars().map(Character::getNumericValue).toArray();
  83.  
  84. int digits1 =Integer.parseInt( String.valueOf(201432014).substring(0,4));
  85. System.out.println("digits are: "+digits1);
  86.  
  87. public static void recursion(int number) {
  88. if(number > 0) {
  89. recursion(number/10);
  90. System.out.printf("%d ", (number%10));
  91. }
  92. }
  93.  
  94. Input: 12345
  95.  
  96. Output: 1 2 3 4 5
  97.  
  98. int year = sc.nextInt(), temp = year, count = 0;
  99.  
  100. while (temp>0)
  101. {
  102. count++;
  103. temp = temp / 10;
  104. }
  105.  
  106. double num = Math.pow(10, count-1);
  107. int i = (int)num;
  108.  
  109. for (;i>0;i/=10)
  110. {
  111. System.out.println(year/i%10);
  112. }
  113.  
  114. 1
  115. 2
  116. 3
  117.  
  118. public static void reverseNumber2(int number) {
  119.  
  120. int residual=0;
  121. residual=number%10;
  122. System.out.println(residual);
  123.  
  124. while (residual!=number) {
  125. number=(number-residual)/10;
  126. residual=number%10;
  127. System.out.println(residual);
  128. }
  129. }
  130.  
  131. int[] digits = intAsString.chars().map(i -> i - '0').toArray();
  132.  
  133. String string = Integer.toString(1234);
  134. int[] digits = new int[string.length()];
  135.  
  136. for(int i = 0; i<string.length(); ++i){
  137. digits[i] = Integer.parseInt(string.substring(i, i+1));
  138. }
  139. System.out.println("digits:" + Arrays.toString(digits));
  140.  
  141. Scanner scanNumber = new Scanner(System.in);
  142. int userNum = scanNumber.nextInt(); // user's number
  143.  
  144. // divides each digit into its own element within an array
  145. List<Integer> checkUserNum = new ArrayList<Integer>();
  146. while(userNum > 0) {
  147. checkUserNum.add(userNum % 10);
  148. userNum /= 10;
  149. }
  150.  
  151. Collections.reverse(checkUserNum); // reverses the order of the array
  152.  
  153. System.out.print(checkUserNum);
  154.  
  155. public static boolean isPalindrome(int input) {
  156. List<Integer> intArr = new ArrayList();
  157. int procInt = input;
  158.  
  159. int i = 0;
  160. while(procInt > 0) {
  161. intArr.add(procInt%10);
  162. procInt = procInt/10;
  163. i++;
  164. }
  165.  
  166. int y = 0;
  167. int tmp = 0;
  168. int count = 0;
  169. for(int j:intArr) {
  170. if(j == 0 && count == 0) {
  171. break;
  172. }
  173.  
  174. tmp = j + (tmp*10);
  175. count++;
  176. }
  177.  
  178. if(input != tmp)
  179. return false;
  180.  
  181. return true;
  182. }
  183.  
  184. int number = 12344444; // or it Could be any valid number
  185.  
  186. int temp = 0;
  187. int divider = 1;
  188.  
  189. for(int i =1; i< String.valueOf(number).length();i++)
  190. {
  191.  
  192. divider = divider * 10;
  193.  
  194. }
  195.  
  196. while (divider >0) {
  197.  
  198. temp = number / divider;
  199. number = number % divider;
  200. System.out.print(temp +" ");
  201. divider = divider/10;
  202. }
  203.  
  204. int num= 4321
  205. int first = num % 10;
  206. int second = ( num - first ) % 100 / 10;
  207. int third = ( num - first - second ) % 1000 / 100;
  208. int fourth = ( num - first - second - third ) % 10000 / 1000;
  209.  
  210. public int[] getDigitsOfANumber(int number) {
  211. String numStr = String.valueOf(number);
  212. int retArr[] = new int[numStr.length()];
  213.  
  214. for (int i = 0; i < numStr.length(); i++) {
  215. char c = numStr.charAt(i);
  216. int digit = c;
  217. int zero = (char) '0';
  218. retArr[i] = digit - zero;
  219.  
  220. }
  221. return retArr;
  222. }
  223.  
  224. int size=i.toString().length(); // the length of the integer (i) we need to split;
  225. ArrayList<Integer> li = new ArrayList<Integer>(); // an ArrayList in whcih to store the resulting digits
  226.  
  227. Boolean b=true; // control variable for the loop in which we will reatrive step by step the digits
  228. String number="1"; // here we will add the leading zero depending on the size of i
  229. int temp; // the resulting digit will be kept by this temp variable
  230.  
  231. for (int j=0; j<size; j++){
  232. number=number.concat("0");
  233. }
  234.  
  235. Integer multi = Integer.valueOf(number); // the variable used for dividing step by step the number we received
  236. while(b){
  237.  
  238. multi=multi/10;
  239. temp=i/(multi);
  240. li.add(temp);
  241. i=i%(multi);
  242. if(i==0){
  243. b=false;
  244. }
  245.  
  246.  
  247. }
  248.  
  249. for(Integer in: li){
  250. System.out.print(in.intValue()+ " ");
  251. }
  252.  
  253. List<Integer> digits = digitsInString.chars().map(Character::getNumericValue)
  254. .collect(Collectors.toList());
  255.  
  256. public static char[] getTheDigits(int value){
  257. String str = "";
  258. int number = value;
  259. int digit = 0;
  260. while(number>0){
  261. digit = number%10;
  262. str = str + digit;
  263. System.out.println("Digit:" + digit);
  264. number = number/10;
  265.  
  266. }
  267. return str.toCharArray();
  268. }
  269.  
  270. public int[] getDigitsOf(int num)
  271. {
  272. int digitCount = Integer.toString(num).length();
  273.  
  274. if (num < 0)
  275. digitCount--;
  276.  
  277. int[] result = new int[digitCount];
  278.  
  279. while (digitCount-- >0) {
  280. result[digitCount] = num % 10;
  281. num /= 10;
  282. }
  283. return result;
  284. }
  285.  
  286. int number = 12345;
  287. int[] digits = getDigitsOf(number);
  288.  
  289. for (int i = 0; i < digits.length; i++) {
  290. System.out.println(digits[i]);
  291. }
  292.  
  293. int number = 12345;
  294. for (int i = 0; i < getDigitsOf(number).length; i++) {
  295. System.out.println( getDigitsOf(number)[i] );
  296. }
  297.  
  298. public int digitsToInt(int[] digits)
  299. {
  300. int digitCount = digits.length;
  301. int result = 0;
  302.  
  303. for (int i = 0; i < digitCount; i++) {
  304. result = result * 10;
  305. result += digits[i];
  306. }
  307.  
  308. return result;
  309. }
  310.  
  311. import java.util.Scanner;
  312.  
  313. class Test
  314. {
  315. public static void main(String[] args)
  316. {
  317. Scanner sc = new Scanner(System.in);
  318.  
  319.  
  320. int num=sc.nextInt();
  321. System.out.println("Enter a number (-1 to end):"+num);
  322. int result=0;
  323. int i=0;
  324. while(true)
  325. {
  326. int n=num%10;
  327. if(n==-1){
  328. break;
  329. }
  330. i++;
  331. System.out.println("Digit"+i+" = "+n);
  332. result=result*10+n;
  333. num=num/10;
  334.  
  335.  
  336. if(num==0)
  337. {
  338. break;
  339. }
  340. }
  341. }
  342. }
  343.  
  344. public static void main(String[] args) {
  345. System.out.println("Digits Array:: "+Arrays.toString(getNumberArr(1100)));
  346. }
  347.  
  348. private static Integer[] getNumberArr(int number) {
  349. //will get the total number of digits in the number
  350. int temp = number;
  351. int counter = 0;
  352.  
  353. while (temp > 0) {
  354. temp /= 10;
  355. counter++;
  356. }
  357. //reset the temp
  358. temp = number;
  359.  
  360. // make an array
  361. int modulo; //modulo is equivalent to single digit of the number.
  362. Integer[] numberArr = new Integer[counter];
  363. for (int i = counter - 1; i >= 0; i--) {
  364. modulo = temp % 10;
  365. numberArr[i] = modulo;
  366. temp /= 10;
  367. }
  368.  
  369. return numberArr;
  370. }
  371.  
  372. Digits Array:: [1, 1, 0, 0]
  373.  
  374. import java.util.Scanner;
  375.  
  376. public class SeparatingDigits {
  377.  
  378. public static void main( String[] args )
  379. {
  380.  
  381. System.out.print( "Enter the digit to print separately :- ");
  382. Scanner scan = new Scanner( System.in );
  383.  
  384. int element1 = scan.nextInt();
  385. int divider;
  386.  
  387. if( ( element1 > 9999 ) && ( element1 <= 99999 ) )
  388. {
  389. divider = 10000;
  390. }
  391. else if( ( element1 > 999 ) && ( element1 <= 9999 ) )
  392. {
  393. divider = 1000;
  394. }
  395. else if ( ( element1 > 99) && ( element1 <= 999 ) )
  396. {
  397. divider = 100;
  398. }
  399. else if( ( element1 > 9 ) && ( element1 <= 99 ) )
  400. {
  401. divider = 10;
  402. }
  403. else
  404. {
  405. divider = 1;
  406. }
  407.  
  408. quotientFinder( element1, divider );
  409.  
  410.  
  411.  
  412.  
  413. }
  414.  
  415. public static void quotientFinder( int elementValue, int dividerValue )
  416. {
  417. for( int count = 1; dividerValue != 0; count++)
  418. {
  419. int quotientValue = elementValue / dividerValue ;
  420. elementValue = elementValue % dividerValue ;
  421. System.out.printf( "%d ", quotientValue );
  422.  
  423. dividerValue /= 10;
  424.  
  425. }
  426. }
  427. }
Add Comment
Please, Sign In to add comment