목록Leetcode (18)

Swimmer

LeetCode 62. Unique Path

Level은 Medium으로 책정되었지만 좀 더 쉬운 난이도의 문제이다. 데이터 구조 Queue를 사용하고 Dynamic Programming 개념을 차용하면 풀 수 있다. class Solution { public: int uniquePaths(int m, int n) { int arr[100][100] = { 0 }; int AlreadyQueue[100][100] = { 0 }; queue grid; pair SearchGrid; grid.push(make_pair(0, 0)); arr[0][0] = 1; while (!grid.empty()) { SearchGrid = grid.front(); grid.pop(); // Go Down if (SearchGrid.first < (m - 1)){ ar..
코딩 문제 2023. 7. 27. 17:14
[LeetCode] 771, Jewels and Stones

Skill Use hash table to decrease time complexity to under log(n^2) Others Use string struct member Use ASCII Number of english letter int gstHashTable[60] = { 0 }; class Solution { public: int numJewelsInStones(string jewels, string stones) { memset(&gstHashTable, 0, sizeof(int) * 60); int RetVal = 0; for (int i = 0; i != stones.size(); ++i) { gstHashTable[stones[i] - 65]++; } for (int i = 0; i ..
코딩 문제 2023. 2. 14. 07:25
[LeetCode] 1720 Decode XORred Array

Solution Use principle : A ^ B = C -> A ^ C = B class Solution { public: vector decode(vector& encoded, int first) { vector res; res.push_back(first); for (int i = 0; i != encoded.size(); ++i) { res.push_back(res.back() ^ encoded[i]); } return res; } };
코딩 문제 2023. 1. 29. 20:03
[LeetCode] 728. Self Dividing Numbers, C++

Solution - Calculate digit, Check integer is divable by all digits class Solution { public: bool IdSelfDividingNumber(int n) { int k = 10; int a = n; for (int i = 1; i != 5; ++i) { int digit = a % k; if (digit == 0) { return false; } else if (n % digit != 0) { return false; } else { // Do Nothing } a = a / k; if (a == 0) { return true; } } return true; } vector selfDividingNumbers(int left, int ..
코딩 문제 2023. 1. 26. 09:58
Prev 1 2 3 4 5 Next