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 / 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>
@fpdjsns
fpdjsns / Pony Express.cpp
Last active March 4, 2019 12:56
[Round 1B 2017] Problem C. Pony Express : https://code.google.com/codejam/contest/8294486/dashboard#s=p2&a=2 Floyd–Warshall
//
// Created by fpdjsns
// Copyright © 2019 fpdjsns. All rights reserved.
//
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#define INF 1e12
typedef long long LL;
@fpdjsns
fpdjsns / Max Consecutive Ones III.cpp
Created March 4, 2019 10:43
[leetcode] 1004. Max Consecutive Ones III : https://leetcode.com/problems/max-consecutive-ones-iii/
class Solution {
public:
int longestOnes(vector<int>& A, int K) {
int answer = 0;
queue<int> zeroQ;
int start = 0;
for(int end=0;end<A.size();end++){
if(A[end] == 0)
zeroQ.push(end);
if(!zeroQ.empty() && zeroQ.size() > K){
@fpdjsns
fpdjsns / Stable Neigh-bors.cc
Created March 2, 2019 06:59
[Round 1B 2017] Problem B. Stable Neigh-bors : https://code.google.com/codejam/contest/8294486/dashboard#s=p1&a=1
//
// Created by fpdjsns
// Copyright © 2019 fpdjsns. All rights reserved.
//
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
@fpdjsns
fpdjsns / Find the Town Judge.cpp
Created March 2, 2019 04:39
[leetcode] 997. Find the Town Judge : https://leetcode.com/problems/find-the-town-judge/
class Solution {
public:
int findJudge(int N, vector<vector<int>>& trust) {
vector<int> cnt(N+1, 0);
for(int i=0;i<trust.size();i++){
int from = trust[i][0];
int to = trust[i][1];
cnt[to]++;
cnt[from] = -N; // The town judge trusts nobody.
}
@fpdjsns
fpdjsns / Cruise Control.cpp
Created February 17, 2019 12:03
[Round 1B 2017] Problem A. Steed 2: Cruise Control : https://code.google.com/codejam/contest/8294486/dashboard
//
// Created by fpdjsns
// Copyright © 2019 fpdjsns. All rights reserved.
//
/*
* 시간복잡도 : O(N)
*/
#include<iostream>
@fpdjsns
fpdjsns / Rotting Oranges.cpp
Created February 17, 2019 11:25
[leetcode][994] Rotting Oranges : https://leetcode.com/problems/rotting-oranges/
class Solution {
private:
const int EMPTY = 0;
const int FRESH = 1;
const int ROTTEN = 2;
struct Cell {
int x;
int y;
int minutes;
@fpdjsns
fpdjsns / Cousins in Binary Tree.cpp
Created February 17, 2019 10:45
[leetcode][993] Cousins in Binary Tree : https://leetcode.com/problems/cousins-in-binary-tree/
/**
* 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 {