MCPcopy Create free account

hub / github.com/ROUTINE-STUDY/Algorithm / functions

Functions538 in github.com/ROUTINE-STUDY/Algorithm

⨍ Functions 538◇ Types & classes 308
↓ 1 callersMethodmajorityElement
(int[] nums)
LeetCode/Array/169. Majority Element/Sanghoo.java:9
↓ 1 callersMethodmajorityElement
(int[] nums)
LeetCode/Array/169. Majority Element/Sanghoo_Array_Counting.java:10
↓ 1 callersMethodmajorityElement
(int[] nums)
LeetCode/Array/169. Majority Element/Sanghoo_HashMap.java:13
↓ 1 callersMethodmaxDepth
(TreeNode root)
LeetCode/BFS/104. Maximum Depth of Binary Tree/Sanghoo.java:22
↓ 1 callersFunctionmaximumUnits
(boxTypes, truckSize)
LeetCode/Greedy/1710. Maximum Units on a Truck/JaeHong.js:1
↓ 1 callersMethodmaximumUnits
(int[][] boxTypes, int truckSize)
LeetCode/Greedy/1710. Maximum Units on a Truck/Sanghoo.java:11
↓ 1 callersMethodmoveGuard
경비병 상태 수정
Programmers/연습문제/LEVEL2/야간 전술보행/Sanghoo.java:51
↓ 1 callersFunctionmySqrt
(x)
LeetCode/Math/69. Sqrt(x)/민재홍.js:1
↓ 1 callersFunctionnormalManCheck
Baekjoon/카테고리 없음/10026 적록색약/Inqbator.kt:38
↓ 1 callersMethodnumWaterBottles
(int numBottles, int numExchange)
LeetCode/Greedy/1518. Water Bottle/Sanghoo.java:6
↓ 1 callersFunctionplaceObstacle
Baekjoon/완전탐색(Brute Force)/18428 감시 피하기/Inqbator.kt:27
↓ 1 callersMethodpostOrder
후위 순회
Baekjoon/트리/1991 트리 순회/Inqbator.kt:78
↓ 1 callersMethodpreOrder
Baekjoon/트리/1991 트리 순회/Inqbator.kt:56
↓ 1 callersFunctionrecursion
Baekjoon/완전탐색(Brute Force)/14888 연산자 끼워넣기/HwangInGyu.kt:18
↓ 1 callersFunctionrecursion
Baekjoon/완전탐색(Brute Force)/2659 십자카드 문제/Inqbator.kt:27
↓ 1 callersMethodrecursion
(int idxOfNumber, int sum)
Baekjoon/완전탐색(Brute Force)/14888 연산자 끼워넣기/HwangInGyu.java:32
↓ 1 callersMethodrecursion
(int idxOfCurrentNode, boolean[] isVisited, int[] answer)
Baekjoon/완전탐색(Brute Force)/10974 모든 순열/HwangInGyu.java:20
↓ 1 callersMethodrecursion
(int n)
Baekjoon/DP(Dynamic Programming)/2747 피보나치 수/HwangIngyu.java:15
↓ 1 callersMethodrecursion
(int[] numbers, int index, int target)
Programmers/깊이 너비 우선 탐색(DFS,BFS)/타겟 넘버/IngyuRecursion.java:8
↓ 1 callersFunctionregGreenManCheck
Baekjoon/카테고리 없음/10026 적록색약/Inqbator.kt:57
↓ 1 callersFunctionremoveNodeRecursively
Baekjoon/카테고리 없음/1068 트리/Inqbator.kt:49
↓ 1 callersMethodreverseWords
(String s)
LeetCode/String/557. Reverse Words in a String III/Sanghoo.java:11
↓ 1 callersMethodsetBasicScore
학생별로 점수를 map에 저장하는 메서드(key : 학생명(숫자), value : 자신의 점수 list)
Programmers/위클리 챌린지/2주차/상호평가/Sanghoo.java:35
↓ 1 callersMethodsingleNumber
(int[] nums)
LeetCode/Array/136. Single Number/Sanghoo_For.java:12
↓ 1 callersMethodsingleNumber
(int[] nums)
LeetCode/Array/136. Single Number/Sanghoo_HashMap.java:14
↓ 1 callersMethodsingleNumber
(int[] nums)
LeetCode/Array/136. Single Number/Sanghoo_Array.java:13
↓ 1 callersMethodsolution
(int[] fees, String[] records)
Programmers/2022 KAKAO BLIND RECRUITMENT/주차 요금 계산/Sanghoo.java:75
↓ 1 callersMethodsolution
(String[] strings, int n)
Programmers/연습문제/LEVEL1/문자열 내 마음대로 정렬하기/Sanghoo.java:11
↓ 1 callersMethodsolution
(int[] food)
Programmers/연습문제/LEVEL1/푸드 파이트 대회/Sanghoo.java:9
↓ 1 callersMethodsolution
(int[] food)
Programmers/연습문제/LEVEL2/푸드 파이트 대회/Sanghoo.java:9
↓ 1 callersMethodsolution
(int distance, int[][] scope, int[][] times)
Programmers/연습문제/LEVEL2/야간 전술보행/Sanghoo.java:88
↓ 1 callersMethodsolution
(int n)
Programmers/연습문제/LEVEL2/숫자의 표현/Sanghoo.java:9
↓ 1 callersMethodsolution
(String s)
Programmers/연습문제/LEVEL2/올바른 괄호/Sanghoo.java:11
↓ 1 callersMethodsolution
(String s)
Programmers/연습문제/LEVEL2/짝 지어 제거하기/Sanghoo.java:11
↓ 1 callersMethodsortSentence
(String s)
LeetCode/Sort/1859. Sorting the Sentence/Sanghoo.java:9
↓ 1 callersMethodsortStack
(Stack<Integer> origin)
LeetCode/Greedy/1046. Last Stone Weight/Sanghoo_Stack.java:27
↓ 1 callersMethodswap
(String[] sArray, int i, int j)
LeetCode/Sort/1859. Sorting the Sentence/IngyuBubbleSort.java:3
↓ 1 callersMethodswipeArrays
(int swipedStartPoint,int swipedEndPoint, int[] array)
LeetCode/Two Pointers/88. Merge Sorted Array/IngyuTwoPointer.java:15
↓ 1 callersMethodwriteWorkList
()
Programmers/연습문제/LEVEL2/야간 전술보행/Sanghoo.java:27
MethodBill
(String record, int[] fees)
Programmers/2022 KAKAO BLIND RECRUITMENT/주차 요금 계산/Sanghoo.java:17
MethodCommand
(String command, String userId)
Programmers/2019 KAKAO BLIND RECRUITMENT/오픈채팅방/Sanghoo_refactoring.java:25
MethodEmployee
(int id, int importance, List<Integer> subordinates)
LeetCode/BFS/690. Employee Importance/Sanghoo.java:13
MethodGuard
(int[] scope, int[] times)
Programmers/연습문제/LEVEL2/야간 전술보행/Sanghoo.java:15
MethodNode
()
LeetCode/DFS/589. N-ary Tree Preorder Traversal/IngyuDFS.java:9
MethodNode
()
LeetCode/BFS/559. Maximum Depth of N-ary Tree/Sanghoo.java:12
MethodPlayer
(int no, int weight, double winRate, int overCount)
Programmers/위클리 챌린지/6주차/복서 정렬하기/Sanghoo.java:11
MethodRoute
(int[] startPoint)
Programmers/Summer Winter Coding(~2018)/방문 길이/HwangInGyu.java:57
MethodTreeNode
()
LeetCode/BFS/637. Average of Levels in Binary Tree/Sanghoo.java:12
MethodTreeNode
()
LeetCode/BFS/104. Maximum Depth of Binary Tree/Sanghoo.java:11
MethodTreeNode
()
LeetCode/BFS/1315. Sum of Nodes with Even-Valued Grandparent/Sanghoo.java:10
MethodTreeNode
()
LeetCode/BFS/1315. Sum of Nodes with Even-Valued Grandparent/Ingyu.java:8
MethodUser
(String nickName)
Programmers/2019 KAKAO BLIND RECRUITMENT/오픈채팅방/Sanghoo.java:8
MethodUser
(String nickName)
Programmers/2019 KAKAO BLIND RECRUITMENT/오픈채팅방/Sanghoo_refactoring.java:8
MethodWork
(int score, int minute)
Baekjoon/구현/17952 과제는 끝나지 않아!/Sanghoo.java:47
MethodWork
(int score, int minute)
Baekjoon/구현/17952 과제는 끝나지 않아!/Inqbator.java:13
FunctionarrayPairSum
(nums)
LeetCode/Greedy/561. Array Partition I/JaeHong.js:1
MethodarrayPairSum
(int[] nums)
LeetCode/Greedy/561. Array Partition I/Sanghoo.java:10
MethodarrayPairSum
(int[] nums)
LeetCode/Greedy/561. Array Partition I/kaki5507.java:2
MethodarrayPairSum
(int[] nums)
LeetCode/Greedy/561. Array Partition I/Ingyu.java:4
MethodaverageOfLevels
(TreeNode root)
LeetCode/BFS/637. Average of Levels in Binary Tree/Sanghoo.java:26
MethodcheckOutline
LeetCode/BFS/463. Island Perimeter/Ingyu.kt:4
Methodclean
Baekjoon/카테고리 없음/14503 로봇 청소기/Inqbator.kt:55
FunctionclimbStairs
(n)
LeetCode/Dynamic Programming/70. Climbing Stairs/JaeHong.js:1
MethodclimbStairs
(int n)
LeetCode/Dynamic Programming/70. Climbing Stairs/Sanghoo.java:12
MethodclimbStairs
(int n)
LeetCode/Dynamic Programming/70. Climbing Stairs/kaki5507.java:2
Methodcompare
(ListNode o1, ListNode o2)
LeetCode/LinkedList/21. Merge Two Sorted Lists/Sanghoo.java:27
Methodcompare
(String o1, String o2)
LeetCode/Sort/1859. Sorting the Sentence/IngyuComparator.java:10
Methodcompare
(String o1, String o2)
LeetCode/String/14. Longest Common Prefix/Sanghoo.java:16
Methodcompare
(int[] o1, int[] o2)
LeetCode/Greedy/1710. Maximum Units on a Truck/Sanghoo.java:16
Methodcompare
(int[] o1, int[] o2)
LeetCode/Greedy/1710. Maximum Units on a Truck/kaki5507.java:7
Methodcompare
(int[] o1, int[] o2)
LeetCode/Greedy/1710. Maximum Units on a Truck/Ingyu.java:8
Methodcompare
(String o1, String o2)
Baekjoon/Greedy/17509 And the Winner Is... Ourselves!/Sanghoo.java:28
Methodcompare
(Player p1, Player p2)
Programmers/위클리 챌린지/6주차/복서 정렬하기/Sanghoo.java:49
Methodcompare
(String s1, String s2)
Programmers/연습문제/LEVEL1/문자열 내 마음대로 정렬하기/kaki5507Comparator.java:10
MethodcompareTo
Baekjoon/구현/2535 아시아 정보올림피아드/Inqbator.kt:5
MethodcountBits
(int n)
LeetCode/Dynamic Programming/338. Counting Bits/Sanghoo.java:8
MethodcountBits
(int n)
LeetCode/Dynamic Programming/338. Counting Bits/Sanghoo_Two.java:8
MethodcountBits
(int n)
LeetCode/Dynamic Programming/338. Counting Bits/Ingyu.java:2
MethodcountBits
(int n)
LeetCode/Dynamic Programming/338. Counting Bits/IngyuBinary.java:2
MethodcountConsistentStrings
(String allowed, String[] words)
LeetCode/String/1684. Count the Number of Consistent Strings/Sanghoo.java:9
MethodcountConsistentStrings
(String allowed, String[] words)
LeetCode/String/1684. Count the Number of Consistent Strings/kaki5507.java:2
MethodcountConsistentStrings_2
(String allowed, String[] words)
LeetCode/String/1684. Count the Number of Consistent Strings/Sanghoo.java:21
MethodcountGoodRectangles
(int[][] rect)
LeetCode/Greedy/1725. Number Of Rectangles That Can Form The Largest Square/kaki5507.java:2
MethodcountGoodRectangles
(int[][] rectangles)
LeetCode/Greedy/1725. Number Of Rectangles That Can Form The Largest Square/Ingyu.java:2
MethoddeepestLeavesSum
(TreeNode root)
LeetCode/BFS/1302. Deepest Leaves Sum/Sanghoo.java:11
MethoddeepestLeavesSum
(TreeNode root)
LeetCode/BFS/1302. Deepest Leaves Sum/kaki5507.java:17
MethoddeepestLeavesSum
LeetCode/BFS/1302. Deepest Leaves Sum/Ingyu.kt:4
MethoddeepestLeavesSum
(TreeNode root)
LeetCode/BFS/1302. Deepest Leaves Sum/IngyuGetSumEveryDepth.java:2
FunctiondestCity
(paths)
LeetCode/String/1436. Destination City/JaeHong.js:1
MethoddestCity
(List<List<String>> paths)
LeetCode/String/1436. Destination City/Sanghoo.java:11
MethoddestCity
(List<List<String>> paths)
LeetCode/String/1436. Destination City/Ingyu.java:6
MethoddiStringMatch
(String s)
LeetCode/Greedy/942. DI String Match/Sanghoo.java:8
MethoddiStringMatch
(String s)
LeetCode/Greedy/942. DI String Match/kaki5507.java:2
MethoddiStringMatch
(String s)
LeetCode/Greedy/942. DI String Match/Ingyu.java:2
FunctiondivisorGame
(N)
LeetCode/Math/1025. Divisor Game/민재홍.js:1
FunctionfindTheDifference
(s, t)
LeetCode/String/389. Find the Difference/JaeHong.js:1
MethodfindTheDifference
(String s, String t)
LeetCode/String/389. Find the Difference/Sanghoo.java:9
MethodfindTheDifference
(String s, String t)
LeetCode/String/389. Find the Difference/Ingyu.java:5
MethodfindWords
(String[] words)
LeetCode/String/500. Keyboard Row/Sanghoo.java:14
MethodfindWords
(String[] words)
LeetCode/String/500. Keyboard Row/kaki5507.java:2
← previousnext →101–200 of 538, ranked by callers