-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathanswer2.java
More file actions
73 lines (68 loc) · 2.33 KB
/
answer2.java
File metadata and controls
73 lines (68 loc) · 2.33 KB
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public int[] twoSum(int[] nums, int target) {
int ans[] = new int[2];
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums.length; j++) {
if (nums[i] + nums[j] == target) {
ans[0] = i;
ans[1] = j;
}
}
}
return ans;
}
public static int romanToInt(String s) {
int ans = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == 'I')
ans++;
else if (s.charAt(i) == 'V')
ans += 5;
else if (s.charAt(i) == 'X')
ans += 10;
else if (s.charAt(i) == 'L')
ans += 50;
else if (s.charAt(i) == 'C')
ans += 100;
else if (s.charAt(i) == 'D')
ans += 500;
else if (s.charAt(i) == 'M')
ans += 1000;
}
return ans;
}
public static void permute(int[] nums) {
ArrayList<ArrayList<Integer>> ans = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> save = new ArrayList<Integer>();
save.add(nums[0]);
ans.add(save);
for (int i = 1; i < nums.length; i++) {
ArrayList<ArrayList<Integer>> save2 = new ArrayList<ArrayList<Integer>>();
for (int j = 0; j < ans.size(); j++) {
for (int k = 0; k <= i; k++) {
ArrayList<Integer> save3 = new ArrayList<Integer>();
save3 = (ans.get(j));
ArrayList<Integer> save4 = new ArrayList<Integer>();
for (int l = 0; l < k; l++)
save4.add(save3.get(l));
save4.add(nums[i]);
for (int l = k; l <= (i - 1); l++)
save4.add(save3.get(l));
save2.add(save4);
}
}
ans = save2;
}
for (int i = 0; i < ans.size(); i++) {
for (int j = 0; j < ans.get(i).size(); j++) {
System.out.print(ans.get(i).get(j));
System.out.print(' ');
}
System.out.print("\n");
}
}
public static void main(String[] args) {
}
}