Java444 [LeetCode/Java] Reverse Words in a String -Codeclass Solution { public String reverseWords(String s) { String[] strArr = s.trim().split(" "); StringBuilder answer = new StringBuilder(); for(int i = strArr.length - 1; i >= 0; i--) { if (!strArr[i].trim().equals("")) { answer.append(strArr[i]); if (i != 0) answer.append(" "); } } return answer.toStri.. 2025. 12. 19. [LeetCode/Java] Reverse Vowels of a String -Codeclass Solution { static char[] vowels = {'a', 'e', 'i', 'o', 'u'}; public String reverseVowels(String s) { List sVowels = new ArrayList(); for (char c : s.toCharArray()) { if (checkVowel(c)) { sVowels.add(c); } } StringBuilder sb = new StringBuilder(); int idx = sVowels.size() - 1; for (char c : s.toCharArr.. 2025. 12. 19. [LeetCode/Java] Can Place Flowers -Codeclass Solution { public boolean canPlaceFlowers(int[] flowerbed, int n) { if (flowerbed.length == 1) { n -= flowerbed[0] == 0 ? 1 : 0; } else { for (int i = 0; i 처음에 위와 같이 해서 맞긴 했으나 복잡해서 다른 풀이를 바탕으로 아래와 같이 다시 풀었습니다.class Solution { public boolean canPlaceFlowers(int[] flowerbed, int n) { for (int i = 0; i 2025. 12. 19. [LeetCode/Java] Kids With the Greatest Number of Candies -Codeclass Solution { public List kidsWithCandies(int[] candies, int extraCandies) { List answer = new ArrayList(); int maxCnt = Integer.MIN_VALUE; for (int candy : candies) maxCnt = Math.max(maxCnt, candy); for (int candy : candies) { answer.add(candy + extraCandies >= maxCnt); } return answer; }} 2025. 12. 19. [LeetCode/Java] Greatest Common Divisor of Strings -Codeclass Solution { public String gcdOfStrings(String str1, String str2) { if (!(str1 + str2).equals(str2 + str1)) return ""; int length = gcd(str1.length(), str2.length()); return str1.substring(0, length); } private static int gcd(int l1, int l2) { if (l2 == 0) return l1; return gcd(l2, l1 % l2); }}처음에 모두 대입해서 풀어보려 했고 문제도 잘못이해해서 여러번 바.. 2025. 12. 19. [LeetCode/Java] Merge Strings Alternately -Codeclass Solution { public String mergeAlternately(String word1, String word2) { StringBuilder sb = new StringBuilder(); int wordLength1 = word1.length(); int wordLength2 = word2.length(); int idx1 = 0; int idx2 = 0; while (idx1 + idx2 2025. 12. 19. 이전 1 ··· 45 46 47 48 49 50 51 ··· 74 다음