Skip to content

Instantly share code, notes, and snippets.

View fpdjsns's full-sized avatar
😄
인생의 풍류를 즐기는 중

withham fpdjsns

😄
인생의 풍류를 즐기는 중
13 followers · 1 following
View GitHub Profile
@fpdjsns
fpdjsns / 째로탈출 2 ( 13460 ).java
Created October 12, 2017 03:43
째로탈출 2 ( 13460 / JAVA ) : https://www.acmicpc.net/problem/13460 BFS
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
class Main {
@fpdjsns
fpdjsns / Number of Enclaves.cpp
Created April 8, 2019 10:57
[leetcode] 1020. Number of Enclaves : https://leetcode.com/problems/number-of-enclaves/
class Solution {
private:
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
public:
int getAnswer(int x, int y, vector<vector<int>>& A){
int r = A.size();
int c = A[0].size();
@fpdjsns
fpdjsns / Best Sightseeing Pair.cpp
Created March 29, 2019 08:30
[leetcode] 1021. Best Sightseeing Pair : https://leetcode.com/problems/best-sightseeing-pair/
class Solution {
public:
int maxScoreSightseeingPair(vector<int>& A) {
int l = 0, r = 0;
int answer = -1e5;
for(int r=1; r<A.size(); r++){
answer =max(answer, A[l] + A[r] + l - r);
if(A[l] <= A[r] + r - l)
l = r;
}
@fpdjsns
fpdjsns / Capacity To Ship Packages Within D Days.cpp
Last active March 22, 2019 06:59
[leetcode] 1014. Capacity To Ship Packages Within D Days : https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/
class Solution {
public:
int shipWithinDays(vector<int>& weights, int D) {
// find minimum weights can Answer
int l = 0;
int r = 0;
for(int i=0;i<weights.size();i++){
int nowWeight = weights[i];
l = max(l, nowWeight);
r += nowWeight;
@fpdjsns
fpdjsns / Pairs of Songs With Total Durations Divisible by 60.cpp
Created March 17, 2019 10:41
[leetcode] 1013. Pairs of Songs With Total Durations Divisible by 60 : https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/
class Solution {
public:
int numPairsDivisibleBy60(vector<int>& time) {
map<int, int> m;
int answer = 0;
for(int i=0;i<time.size();i++){
int rest = time[i] % 60;
m[rest]++;
}
for(map<int,int>::iterator it = m.begin(); it != m.end(); it++){
@fpdjsns
fpdjsns / Complement of Base 10 Integer.cpp
Created March 17, 2019 10:03
[leetcode] 1012. Complement of Base 10 Integer : https://leetcode.com/problems/complement-of-base-10-integer/
class Solution {
public:
int bitwiseComplement(int N) {
if(N == 0) return 1;
int tmp = 1;
int answer = 0;
while(0 < N){
answer += ((N + 1) % 2) * tmp;
N /= 2;
tmp *= 2;
@fpdjsns
fpdjsns / Maximize Sum Of Array After K Negations.cpp
Created March 16, 2019 08:32
[leetcode] 1005. Maximize Sum Of Array After K Negations : https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/
class Solution {
public:
int largestSumAfterKNegations(vector<int>& A, int K) {
sort(A.begin(), A.end());
int answer = 0;
int lastMinus = 1e9;
for(int i=0;i<A.size();i++){
if(A[i] < 0){
if(0 < K){
A[i] *= -1; K--;
@fpdjsns
fpdjsns / Construct Binary Search Tree from Preorder Traversal.cpp
Created March 13, 2019 12:14
[leetcode] 1008. Construct Binary Search Tree from Preorder Traversal : https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
@fpdjsns
fpdjsns / Maximum Binary Tree II.cpp
Created March 10, 2019 02:35
[leetcode] 998. Maximum Binary Tree II : https://leetcode.com/problems/maximum-binary-tree-ii/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
@fpdjsns
fpdjsns / Ample Syrup.cpp
Last active March 7, 2019 11:35
[Round 1C 2017] Problem A. Ample Syrup : https://code.google.com/codejam/contest/3274486/dashboard#s=p0&a=0
//
// Created by fpdjsns
// Copyright © 2019 fpdjsns. All rights reserved.
//
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>