본문 바로가기

알고리즘

 (28)
letCode - Roman to Integer import java.util.Arrays; import java.util.HashMap; public class algo { public static void main(String[] args) { String s = "MCMXCIV"; romanToInt(s); } public static int romanToInt(String s) { Character[] romans = {'M', 'D', 'C', 'L', 'X', 'V', 'I'}; int[] values = {1000, 500, 100, 50, 10, 5, 1}; int answer = 0; HashMap integerHashMap = new HashMap(); for (int i = 0; i < romans.length; i++) { int..
letCode - Longest Palindromic Substring ( 1차 ) import java.util.*; public class algo { public static void main(String[] args) { String s = "a"; longestPalindrome(s); } public static boolean isPalindromic(String s) { StringBuffer sb = new StringBuffer(s); if (sb.toString().equals(sb.reverse().toString())) { return true; } return false; } public static String longestPalindrome(String s) { String answer = ""; for (int i = 0; i < s.length(); i++..
letCode - Add Two Numbers import java.util.*; import java.util.concurrent.atomic.AtomicInteger; import java.util.stream.Collectors; import java.util.stream.IntStream; public class algo { public static void main(String[] args) { ListNode listNode11 = new ListNode(); ListNode listNode21 = new ListNode(); ListNode listNode31 = new ListNode(); listNode11.val = 2; listNode21.val = 4; listNode31.val = 3; listNode11.next = list..
leetCode - twoSum class Solution { public int[] twoSum(int[] nums, int target) { int[] answer = {}; Map integerIntegerMap = new HashMap(); for (int i = 0; i
프로그래머스 모의고사 import java.util.*; import java.util.stream.IntStream; public class algo { public static void main(String[] args) { int[] answers = {1,3,2,4,2}; solution(answers); } public static class StudentInfo { int studentNumber; int[] studentAnswer; int studentScore = 0; int answerLength; public void setStudentScore(int studentScore) { this.studentScore = studentScore; } public StudentInfo(int studentNumb..
프로그래머스 더 맵게 import java.util.*; import java.util.stream.Collectors; public class algo { public static void main(String[] args) { int[] scoville = {1, 2, 3, 9, 10, 12}; int k = 7; solution(scoville, k); } public static class ScovilleMixInfo { private int firstScouvileNum; private int secondScouvileNum; private int mixedScouvileNum; public ScovilleMixInfo() { } } public static void mixedScovilleFood(PriorityQ..
프로그래머스 가장큰수 import java.util.*; import java.util.function.Function; import java.util.function.IntToDoubleFunction; import java.util.stream.Collector; import java.util.stream.Collectors; import java.util.stream.IntStream; public class algo { public static void main(String[] args) { int[] numbers = { 6, 10, 2 }; solution(numbers); } public static String solution(int[] numbers) { String answer = ""; List numbe..
프로그래머스 완주하지 못한선수 (튜닝) import java.util.Arrays; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.stream.Collectors; import java.util.stream.IntStream; public class algo { public static void main(String[] args) { String[] participant = {"leo", "kiki", "eden"}; String[] completion = {"eden", "kiki"}; solution(participant, completion); } public static class MarathonInfo { String[] p..

티스토리툴바