Skip to content

Commit 5535c16

Browse files
GoogleokGoogleok
committed
leetcode 2일차
1 parent bc00796 commit 5535c16

3 files changed

Lines changed: 50 additions & 1 deletion

File tree

‎.gitignore‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,4 +2,5 @@
22
.project
33
org.*
44
*.class
5-
bin/
5+
bin/
6+
java_algorithm.iml

‎src/leetcode/easy/palindrome_number.java‎

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
package leetcode.easy;
2+
3+
public class palindrome_number {
4+
public static void main(String[] args) {
5+
int x = 10;
6+
System.out.println(isPalindrome(x));
7+
}
8+
9+
static public boolean isPalindrome(int x) {
10+
String strX = x + "";
11+
String rStrX = "";
12+
13+
for (int i = strX.length() - 1; i >= 0; i--) {
14+
rStrX += strX.charAt(i) + "";
15+
}
16+
17+
return strX.equals(rStrX);
18+
}
19+
}

‎src/leetcode/easy/two_sum.java‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
package leetcode.easy;
2+
3+
import java.util.Arrays;
4+
import java.util.HashMap;
5+
import java.util.Map;
6+
7+
public class two_sum {
8+
public static void main(String[] args) {
9+
int[] nums = {3, 3};
10+
int target = 6;
11+
System.out.println(Arrays.toString(twoSum(nums, target)));
12+
}
13+
14+
static public int[] twoSum(int[] nums, int target) {
15+
int[] answer = new int[2];
16+
Map<Integer, Integer> map = new HashMap<>();
17+
18+
for (int i = 0; i < nums.length; i++) {
19+
if (map.containsKey(target - nums[i])) {
20+
answer[0] = map.get(target - nums[i]);
21+
answer[1] = i;
22+
return answer;
23+
}
24+
map.put(nums[i], i);
25+
}
26+
27+
return answer;
28+
}
29+
}

0 commit comments

Comments
 (0)