SELECT
employee_id
, department_id
FROM
Employee
GROUP BY
employee_id
HAVING
COUNT(*) = 1
UNION
SELECT
employee_id
, department_id
FROM
Employee
WHERE
primary_flag = 'Y'
;
SELECT
employee_id
, department_id
FROM
(
SELECT
employee_id
, department_id
, COUNT(employee_id) OVER (PARTITION BY employee_id) AS ct
, primary_flag FROM Employee
) AS sub
WHERE
ct=1
OR primary_flag='Y'
;
SELECT employee_id, department_id
FROM Employee
WHERE primary_flag='Y' OR
employee_id IN
(SELECT employee_id
FROM Employee
Group by employee_id
having count(employee_id)=1)
WITH employee_count AS (
SELECT
employee_id
, COUNT(*) AS appearance_count
FROM
Employee
GROUP BY
employee_id
)
SELECT
Employee.employee_id
, department_id
FROM
Employee e
JOIN employee_count ec
ON e.employee_id=ec.employee_id
WHERE
e.primary_flag='Y'
OR (e.primary_flag='N'
AND ec.appearance_count=1)
solution = lambda sizes: max(sum(sizes, [])) * max(min(size) for size in sizes)
def solution(sizes):
row = 0
col = 0
for a, b in sizes:
if a < b:
a, b = b, a
row = max(row, a)
col = max(col, b)
return row * col
def solution(sizes):
w = []
h = []
for i in range(len(sizes)):
if sizes[i][0] >= sizes[i][1]:
w.append(sizes[i][0])
h.append(sizes[i][1])
else:
h.append(sizes[i][0])
w.append(sizes[i][1])
return max(w) * max(h)
확실히 알아두면 만사가 편해지는 머신러닝 10가지 알고리즘