Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- C++
- 수치최적화
- 선형대수
- Leetcode
- 강화학습
- Graph Neural Network
- solver
- OSQP
- 소프티어
- Recursion
- PathPlanning
- C
- GNN
- 경로생성
- 백준
- self driving car
- MDP
- Frenet Coordinate
- 동적라이브러리
- Dubins Path
- CUDA
- 공유라이브러리
- CPP
- autonomous vehicle
- DynamicProgramming
- 정적라이브러리
- Hybrid A star
- GIT
- path planning
- Motion Planning
Archives
- Today
- Total
Swimmer
[LeetCode] 1941. Check if All Characters Have Equal Number of Occurrences, C 본문
코딩 문제
[LeetCode] 1941. Check if All Characters Have Equal Number of Occurrences, C
Zach Choi 2022. 12. 31. 12:05Solution
- Use Hash Map
- Compare Counting Number of each Character (except 0 occurence character)
#define NumOfLowerCaseEnglishLetter 26
#define ASCII_INIT_NUM_IDX 97
bool areOccurrencesEqual(char* s) {
long int NumOfChar = 0;
int RefNum = 0;
int arr[NumOfLowerCaseEnglishLetter] = { 0 }; // consists of lowercase English letters
bool RetVal = true;
while (s[NumOfChar] != '\0')
{
++arr[s[NumOfChar] - NumOfLowerCaseEnglishLetter];
++NumOfChar;
}
for (long int i = 0; i != NumOfLowerCaseEnglishLetter; ++i)
{
if (RefNum == 0 && arr[i] != 0)
{
RefNum = arr[i];
}
else if (RefNum != 0 && arr[i] != 0)
{
if (RefNum != arr[i])
{
RetVal = false;
}
else
{
// Do Nothing
}
}
}
return RetVal;
}
'코딩 문제' 카테고리의 다른 글
[LeetCode] 2283. Check if Number Has Equal Digit Count and Digit Value, C (0) | 2023.01.01 |
---|---|
[LeetCode] 888. Fair Candy Swap, C (0) | 2022.12.31 |
[LeetCode] 383. Ransom Note, C (0) | 2022.12.30 |
[LeetCode] 876. Middle of the Linked List, C (0) | 2022.12.28 |
[LeetCode] 1342 Number of Steps to Reduce a Number to Zero, C (0) | 2022.12.28 |
Comments