Exercism
本栏主要是对Exercism上练习题的一些总结和思考
陈小易
生活明朗,万物可爱,人间值得,未来可期
展开
-
2020-11-25
题目解法:import java.util.Arrays;import java.util.List;import java.util.stream.Collectors;public class Allergies { private final int totalScore = 255; private int score; public Allergies(int score) { if (score > totalScore) { score = sc.原创 2020-11-25 13:31:22 · 164 阅读 · 0 评论 -
exercism————Roman Numerals
题目:解法一:package exercism;import org.omg.PortableInterceptor.INACTIVE;import java.util.HashMap;import java.util.Map;/** * 右加左减 * 左减数字必须为一位且仅限于Ⅰ、Ⅹ、Ⅽ ,右加数字不能超过三位 * 转换3000以内就可以了 */public class RomanNumerals { private String romanNumber;.原创 2020-11-21 11:40:36 · 217 阅读 · 0 评论 -
Exercism——ResistorColor
题目:解法一:package exercism;import java.util.HashMap;import java.util.Map;public class ResistorColor { private Map<String,Integer> colorMap; private String[] colors = {"Black","Brown","Red","Orange","Yellow","Green","Blue","Violet","Grey",.原创 2020-11-09 16:06:18 · 303 阅读 · 0 评论 -
exercism————Knapsack
题目:解法一:public int maximumValue(int capacity,List<Item> items) { return IntStream.range(0, items.size()) .filter(i -> items.get(i).getWeight() <= capacity) .map(i -> items.get(i).getValue() + this.maximumValue(capacity .原创 2020-11-02 14:04:28 · 128 阅读 · 0 评论 -
exercism————Series
题目:解法: Set<List<Character>> getAllSubSet(String str, int digits) { // check the input if (str.matches("[^0-9]") || digits > str.length()) {throw new IllegalArgumentException("Invalid input");} // put every subSet into.原创 2020-10-20 18:49:42 · 85 阅读 · 0 评论 -
exercism ————LargestSeriesProduct
题目:解法一:public int getLargestSeriesProduct(String input,int digits) { // put numbers in int array int [] numSet = new int [input.length()]; for (int i = 0; i < numSet.length; i++) { numSet[i] = Character.getNumericValue(input.charAt(i));.原创 2020-10-20 17:23:13 · 102 阅读 · 0 评论 -
exercism————NucleotideCount
题目:解法:package exercism;import java.util.HashMap;import java.util.Map;public class NucleotideCount { static Map<Character,Integer> nucleotideMap = new HashMap<>(); public NucleotideCount(String sequence) { // check sequence if .原创 2020-10-20 17:09:27 · 85 阅读 · 0 评论 -
exercism————Luhn
题目:解法一:boolean isVlaid(String s) { String number = s.replaceAll(" ",""); // check the argument if (number.length() <= 1 || number.matches("[^0-9]")) {throw new IllegalArgumentException("Invalid Argument");} // Converse char to int char.原创 2020-10-20 15:07:22 · 195 阅读 · 0 评论 -
exercism————Diamonds
题目:方法一:static final char[] ALPHABET = {'A','B','C','D','E','F','G','H','I','G','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; public void printDimond(char letter) { if (!alphabetContains(letter)) {throw new InputMismatchExcept.原创 2020-10-17 12:18:22 · 248 阅读 · 2 评论 -
exercism————ISBN Verifier
题目:解法一: boolean isbnVerifier(String stringToVerify) { int sum = 0; String numbers = stringToVerify.replaceAll("[^0-9X]","").toString(); if (numbers.length() != 10 ) { throw new IllegalArgumentException("Invalid Argument");} int[] output =.原创 2020-10-17 11:16:28 · 69 阅读 · 0 评论 -
exercism————Hamming
题目:解法package exercism;public class Hamming { public int hammingDistance = 0; static final char[] dnaElements = {'G','A','C','T'}; public Hamming(String DNA1, String DNA2) throws InvalidDNAException { if (DNA1 == null || DNA2 == null) { th.原创 2020-10-11 17:47:19 · 205 阅读 · 0 评论 -
exercism————TwelveDays
题目:解法1:package exercism;public class TwelveDays { void songLyrics() { String[] s1 = {"first","second","third","forth","fifth","sixth","seventh","eighth","ninth","tenth","eleventh","twelfth"}; String[] s2 = {"a Partridge in a Pear Tree. ","tw.原创 2020-10-11 10:01:40 · 149 阅读 · 0 评论 -
Exercism————Proverb
题目:解法一:package exercism;public class Proverb { private String[] list; public Proverb(String[] list) { this.list = list; } String generateProverb(String[] list) { StringBuilder output = new StringBuilder(); for (int i = 0; i < list.l.原创 2020-05-12 13:21:45 · 94 阅读 · 0 评论 -
Exercism————Protein Translation
题目:最优解法:package practice;import java.util.ArrayList;import java.util.HashMap;import java.util.List;class ProteinTranslator{ static final String STOP = "STOP"; HashMap<String,String> proteinMap = new HashMap<>(); //@Constructor.原创 2020-05-09 15:21:10 · 248 阅读 · 0 评论 -
exercism————ReverseString
题目:Reverse a stringFor example: input: “cool” output: “looc”解法一:String reverseString(String word) { return new StringBuilder(word).reverse().toString(); }解法二:String reverseWay2(String i...原创 2020-04-03 12:19:44 · 93 阅读 · 0 评论 -
exercism————Anagram
题目:解法一:public class Anagram { String anagramTest(String word,String... list) { StringBuilder sublist = new StringBuilder(); for (int i = 0; i <list.length ; i++) { if (word.contains...原创 2020-03-31 13:24:17 · 117 阅读 · 0 评论 -
exercism————TwoFer
题目:解法一:public class TwoFer { String twoFerTest(String name) { return name == null ? "One for you,one for me" : "One for " + name + ",one for me"; }}解法二:import java.util.Optional;...原创 2020-03-29 23:14:35 · 141 阅读 · 0 评论 -
exercism————Isogram
题目:解法1:boolean isIsogram(String phrase) { phrase = phrase.replace("-", "").replace(" ", "").toLowerCase(); return (phrase.chars().distinct().count() == phrase.length()); }解法2:...原创 2020-03-23 12:18:24 · 207 阅读 · 0 评论 -
exercism————Raindrops
题目:解法:public class Raindrops { String convert (int number) { String output = ""; if (number % 3 == 0) { output += "Pling"; } if (number % 5 == 0) { output += "Plang"; } i...原创 2020-03-20 12:23:01 · 151 阅读 · 0 评论