개발자가 되는 과정

문제주소 leetcode.com/problems/palindrome-number/ leetcode.com/problems/longest-common-prefix/ leetcode.com/problems/linked-list-cycle/ 내 풀이 && 다른 사람 풀이 public static boolean isPalindrome(int x) { String original = String.valueOf(x); StringBuilder reversed = new StringBuilder(); for (int i = original.length() - 1; i > -1; i--) { reversed.append(original.charAt(i)); } return original.equals(reversed...

문제주소 leetcode.com/problems/two-sum/ leetcode.com/problems/reverse-integer/ leetcode.com/problems/remove-duplicates-from-sorted-list/ 내 풀이 && 다른 사람 풀이 public static int[] twoSum(int[] nums, int target) { int[] answer = new int[2]; for (int i = 0; i < nums.length; i++) { for (int j = i + 1; j < nums.length; j++) { if ((nums[i] + nums[j]) == target) { answer[0] = i; answer[1] = j; return answer; } ..