Loading...
More Java Posts
public class Main {public static void main(String[] args) {System.out.println("Hello World");}}
class main {public static boolean findDuplicates(int[] nums) {for(int i = 0; i < nums.length; i++) {for(int j = 0; j < i; j++) {if(nums[i] == nums[j]) {return true;}}}return false;}public static void main(String[] args) {int[] myArray = {1,3};System.out.println(findDuplicates(myArray));}}
import java.io.File;import java.io.IOException;import java.util.Map;import java.util.Scanner;import java.util.TreeMap;public class SimpleWordCounter {public static void main(String[] args) {try {File f = new File("ciaFactBook2008.txt");Scanner sc;sc = new Scanner(f);// sc.useDelimiter("[^a-zA-Z']+");Map<String, Integer> wordCount = new TreeMap<String, Integer>();while(sc.hasNext()) {String word = sc.next();if(!wordCount.containsKey(word))wordCount.put(word, 1);elsewordCount.put(word, wordCount.get(word) + 1);}// show resultsfor(String word : wordCount.keySet())System.out.println(word + " " + wordCount.get(word));System.out.println(wordCount.size());}catch(IOException e) {System.out.println("Unable to read from file.");}}}
import java.util.Arrays;public class Main {public static int findMinNonCreatableSum(int[] coins) {// Sort the arrayArrays.sort(coins);// Initialize max creatable sumint maxCreatable = 0;// Iterate through coinsfor (int coin : coins) {// If current coin is greater than maxCreatable + 1,// we found our answerif (coin > maxCreatable + 1) {return maxCreatable + 1;}// Add current coin to maxCreatablemaxCreatable += coin;}// If we can create all sums up to maxCreatable,// the answer is maxCreatable + 1return maxCreatable + 1;}public static void main(String[] args) {int[] coins = {2, 9, 1, 2, 7};int result = findMinNonCreatableSum(coins);System.out.println("Smallest sum that cannot be created: " + result);}}
import java.util.Arrays;public class QuickSortMain {private static int array[];public static void sort(int[] arr) {if (arr == null || arr.length == 0) {return;}array = arr;quickSort(0, array.length-1);}private static void quickSort(int left, int right) {int i = left;int j = right;// find pivot number, we will take it as midint pivot = array[left+(right-left)/2];while (i <= j) {/*** In each iteration, we will increment left until we find element greater than pivot* We will decrement right until we find element less than pivot*/while (array[i] < pivot) { i++; } while (array[j] > pivot) {j--;}if (i <= j) {exchange(i, j);//move index to next position on both sidesi++;j--;}}// call quickSort() method recursivelyif (left < j)quickSort(left, j);if (i < right)quickSort(i, right);}private static void exchange(int i, int j) {int temp = array[i];array[i] = array[j];array[j] = temp;}public static void main(String a[]){int[] input = {33,21,45,64,55,34,11,8,3,5,1};System.out.println("Before Sorting : ");System.out.println(Arrays.toString(input));sort(input);System.out.println("==================");System.out.println("After Sorting : ");System.out.println(Arrays.toString(array));}}
import java.util.Scanner;/* In Heaven, the seed is tall and the oak small / It's input vital* "The al-Madinatian," verse 236-37* tinyurl.com/17snqkfv* email answer to [email protected]**/public class Main{public static void main(String args[]){int x = 0;int a, c, m = 10000;Scanner in = new Scanner(System.in);System.out.println("Please enter a seed, maximum 3000000:");x = in.nextInt();System.out.println("Please input a number, maximum 29:");a = in.nextInt();System.out.println("Please input a number, maximum 999999:");c = in.nextInt();char menu = 'y';while(menu != 'n'){x = (a*x + c) % m;System.out.println("The next number is " + x + "\nWould you like another? (y/n)");menu = in.next().charAt(0);}}}//██╗ ░█████╗░███╗░░░███╗ ██████╗░░█████╗░███████╗██████╗░░█████╗░██╗░░░░░██╗░░░██╗░██████╗//██║ ██╔══██╗████╗░████║ ██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║░░░░░██║░░░██║██╔════╝//██║ ███████║██╔████╔██║ ██║░░██║███████║█████╗░░██║░░██║███████║██║░░░░░██║░░░██║╚█████╗░//██║ ██╔══██║██║╚██╔╝██║ ██║░░██║██╔══██║██╔══╝░░██║░░██║██╔══██║██║░░░░░██║░░░██║░╚═══██╗//██║ ██║░░██║██║░╚═╝░██║ ██████╔╝██║░░██║███████╗██████╔╝██║░░██║███████╗╚██████╔╝██████╔╝//╚═╝ ╚═╝░░╚═╝╚═╝░░░░░╚═╝ ╚═════╝░╚═╝░░╚═╝╚══════╝╚═════╝░╚═╝░░╚═╝╚══════╝░╚═════╝░╚═════╝░