题
思
leetcode679
我放弃的比我想象的要快。
5分钟,大概就放弃了。
看了题解并不难,只是一个穷举。
题解。
leetcode620
SQL题又来了,这题也太蠢了吧。
代码
leetcode679
class Solution {
private double min = 1e-6;
public boolean judgePoint24(int[] nums) {
List<Double> list = new ArrayList<Double>();
for (int num : nums) {
list.add((double) num);
}
return dfs(list);
}
private boolean dfs(List<Double> list) {
if (list.size() == 0) {
return false;
}
if (list.size() == 1) {
return Math.abs(list.get(0) - 24) < min;
}
for (int i = 0; i < list.size(); i++) {
for (int j = 0; j < list.size(); j++) {
if (i != j) {
List<Double> temp = new ArrayList<Double>();
for (int k = 0; k < list.size(); k++) {
if (k != i && k != j) {
temp.add(list.get(k));
}
}
for (int k = 0; k < 4; k++) {
switch (k) {
case 0:
temp.add(list.get(i) + list.get(j));
break;
case 1:
temp.add(list.get(i) - list.get(j));
break;
case 2:
temp.add(list.get(i) * list.get(j));
break;
default:
if (Math.abs(list.get(j)) < min) {
continue;
}
temp.add(list.get(i) / list.get(j));
break;
}
if (dfs(temp)) {
return true;
}
temp.remove(temp.size() - 1);
}
}
}
}
return false;
}
}
leetcode620
SELECT
id, movie, description, rating
FROM
cinema
WHERE
description <> 'boring' AND id MOD 2 = 1
ORDER BY rating DESC;