ReviewCoding

[JAVA] LeetCode/Easy 검색 결과

해당 글 18건

[LeetCode/릿코드] 67. Add Binary

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 import java.math.BigInteger; class Solution { public String addBinary(String a, String b) { BigInteger a1 = new BigInteger(a, 2); BigInteger b1 = new BigInteger(b, 2); BigInteger sum = a1.add(b1); return sum.toString(2); } } Colored by Color Scripter cs

[JAVA] LeetCode/Easy 2023. 1. 24. 18:51

[LeetCode/릿코드] 66. Plus One

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.math.BigInteger; import java.util.Arrays; class Solution { public int[] plusOne(int[] digits) { String num = ""; for(int i=0; i

[JAVA] LeetCode/Easy 2023. 1. 24. 18:49

[LeetCode/릿코드] 58. Length of Last Word

문제 풀이 1 2 3 4 5 6 class Solution { public int lengthOfLastWord(String s) { String[] split = s.split("[\s]+"); return split[split.length-1].length(); } } Colored by Color Scripter cs

[JAVA] LeetCode/Easy 2023. 1. 24. 18:46

[LeetCode/릿코드] 35. Search Insert Position

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 class Solution { public int searchInsert(int[] nums, int target) { for(int i=0; i target){ return i; } } return nums.length; } } Colored by Color Scripter cs

[JAVA] LeetCode/Easy 2023. 1. 13. 16:19

[LeetCode/릿코드] 27. Remove Element

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 class Solution { public int removeElement(int[] nums, int val) { if(nums.length == 0){ return 0; } int i = 0; int j = nums.length-1; while(i

[JAVA] LeetCode/Easy 2023. 1. 13. 16:16

[LeetCode/릿코드] 26. Remove Duplicates from Sorted Array

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 class Solution { public int removeDuplicates(int[] nums) { int answer = 1; for(int i=0; i

[JAVA] LeetCode/Easy 2023. 1. 12. 20:16

[LeetCode/릿코드] 14. Longest Common Prefix

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 class Solution { public String longestCommonPrefix(String[] strs) { int min = 201; for(int i=0; i

[JAVA] LeetCode/Easy 2023. 1. 12. 20:14

[LeetCode/릿코드] 13. Roman to Integer

문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 class Solution { public int romanToInt(String s) { int answer = 0; int curr = 0; int prev = 0; for (int i = s.length() - 1; i >= 0; i--) { switch (s.charAt(i)) { case 'M': curr = 1000; break; case 'D': curr = 500; break; case 'C': curr = 100; break; case 'L': curr = 50; break; case 'X': curr = 10; break; case 'V': curr..

[JAVA] LeetCode/Easy 2023. 1. 9. 17:35