• Feb 6, 2021 •Daedalus
0 likes • 0 views
public class Daedalus extends Athenian { private Story story; public ArrayList<Skill> skills = new ArrayList<Skill>(); public ArrayList<Athenian> children = new ArrayList<Athenian>(); public Daedalus(Story story, ArrayList<Skill> inherentSkills) { if(story != null) System.out.println("ERROR No one is created with a story."); skills.add(inherentSkills); } public Momento advanceStory(Scene s) { System.err.println("ERROR Don't know how to proceed..."); } } //██╗ ░█████╗░███╗░░░███╗ ██████╗░░█████╗░███████╗██████╗░░█████╗░██╗░░░░░██╗░░░██╗░██████╗ //██║ ██╔══██╗████╗░████║ ██╔══██╗██╔══██╗██╔════╝██╔══██╗██╔══██╗██║░░░░░██║░░░██║██╔════╝ //██║ ███████║██╔████╔██║ ██║░░██║███████║█████╗░░██║░░██║███████║██║░░░░░██║░░░██║╚█████╗░ //██║ ██╔══██║██║╚██╔╝██║ ██║░░██║██╔══██║██╔══╝░░██║░░██║██╔══██║██║░░░░░██║░░░██║░╚═══██╗ //██║ ██║░░██║██║░╚═╝░██║ ██████╔╝██║░░██║███████╗██████╔╝██║░░██║███████╗╚██████╔╝██████╔╝ //╚═╝ ╚═╝░░╚═╝╚═╝░░░░░╚═╝ ╚═════╝░╚═╝░░╚═╝╚══════╝╚═════╝░╚═╝░░╚═╝╚══════╝░╚═════╝░╚═════╝░
• Jan 31, 2023 •AustinLeath
public class UserService { private UserRepository userRepository; public UserService(UserRepository userRepository) { this.userRepository = userRepository; } public User getUserById(long id) { try { return userRepository.getUserById(id); } catch (Exception e) { // Log the exception here System.out.println("An error occurred while fetching the user: " + e.getMessage()); return null; } } } public class UserRepository { public User getUserById(long id) throws Exception { // Database query to fetch the user if (id < 0) { throw new Exception("Invalid user id"); } // Return the user object return new User(id, "John Doe"); } } public class User { private long id; private String name; public User(long id, String name) { this.id = id; this.name = name; } public long getId() { return id; } public String getName() { return name; } }
• Nov 19, 2022 •CodeCatch
0 likes • 1 view
public class Factorial { public static void main(String[] args) { final int NUM_FACTS = 100; for(int i = 0; i < NUM_FACTS; i++) System.out.println( i + "! is " + factorial(i)); } public static int factorial(int n) { int result = 1; for(int i = 2; i <= n; i++) result *= i; return result; } }
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); else wordCount.put(word, wordCount.get(word) + 1); } // show results for(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."); } } }
• Oct 15, 2022 •CodeCatch
0 likes • 8 views
public static String addBinary(){ // The two input Strings, containing the binary representation of the two values: String input0 = "1010"; String input1 = "10"; // Use as radix 2 because it's binary int number0 = Integer.parseInt(input0, 2); int number1 = Integer.parseInt(input1, 2); int sum = number0 + number1; return Integer.toBinaryString(sum); //returns the answer as a binary value; }
• May 21, 2025 •AustinLeath
0 likes • 3 views
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)); } }