전체 글67 Push Dominoes // mine // 40ms, 16.6MB class Solution { public: string pushDominoes(string dominoes) { int size = dominoes.size(); vector counter(size); char prev = dominoes[0]; int count = 0; for (int i = 1; i < size; ++i) { char cur = dominoes[i]; if (cur == '.' && prev == 'R') counter[i] = ++count; if (cur == 'L' || cur == 'R') { count = 0; prev = cur; } } prev = dominoes[size - 1]; count = 0; for (int i = .. 2021. 7. 22. tree - dfs 간선 정보가 주어진 경우, 트리를 생성할 수 있다. 트리 순회가 필요한 경우, dfs()로 문제해결할 수 있다. 간선정보 : (u, v) 트리 생성 : tree[u][v] = true, tree[v][u] = true // tree[u].push_back(v), tree[v].push_back(u) // dfs() : visit[] or parent 값으로 continue 조정. for (child : tree[u]) if (visit[child]) continue; 2021. 4. 21. leetcode - Find the Town Judge - easy https://leetcode.com/problems/find-the-town-judge/ Find the Town Judge - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public: int findJudge(int n, vector& trust) { vector first_(n+1); vector second_(n+1); int size = trust.size(); for (int i = 0; i < size; ++i) {.. 2020. 9. 22. overwrite vfpr 테스트 환경 - win10 - visual studio 2012 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 #include #pragma warning(disable:4996) class A { public: A() : a(1) { } virtual void f() { printf("A::f() = %d\n", a); } int a; }; class B : public A { public: B() : A() { a = 2; this->A::A(); } void f() { printf("B::f() = %d\n", a); } }; int main() { A a; B b; A *pB = &b; a.f(.. 2019. 1. 27. 이전 1 ··· 13 14 15 16 17 다음
