MCPcopy Create free account

hub / github.com/ctfu/Leetcode / functions

Functions771 in github.com/ctfu/Leetcode

⨍ Functions 771◇ Types & classes 491
↓ 1 callersMethodtraverse
(TreeNode root)
algorithm/binaryTreeTilt.java:67
↓ 1 callersMethodtreePaths
(TreeNode root, List<String> paths, String path)
algorithm/binaryTreePaths.java:27
↓ 1 callersMethodtreeSum
(TreeNode root)
algorithm/mostFrequentSubstreeSum.java:23
↓ 1 callersMethodvalidBSTHelper
(TreeNode root)
algorithm/validBinarySearchTree.java:15
↓ 1 callersMethodvalidTagContent
(String content)
algorithm/tagValidator.java:56
↓ 1 callersMethodvalidTagName
(String name, boolean closingTag)
algorithm/tagValidator.java:35
↓ 1 callersMethodwin
(char[] str)
algorithm/flipGameII.java:10
↓ 1 callersMethodwordSearch
(List<String> res, char[][] board, int x, int y, TrieNode root, boolean[][] visited)
algorithm/wordSearchII.java:16
↓ 1 callersMethodwordSearch
(char[][] board, int i, int j, String word, boolean[][] visited, int index)
algorithm/wordSearch.java:16
MethodArrayContainer
(int val, int index, int row)
algorithm/smallestRange.java:46
MethodBSTIterator
(TreeNode root)
algorithm/binarySearchTreeIterator.java:12
MethodCell
(int x, int y, int height)
algorithm/trappingWaterII.java:49
MethodContainer
(boolean isBST, long min, long max)
algorithm/validBinarySearchTree.java:30
MethodContainer
(int size, int min, int max)
algorithm/largestBSTSubtree.java:32
MethodCourse
(int i)
algorithm/courseScheduleII.java:85
MethodInterval
(int min, int max)
algorithm/132Pattern.java:55
MethodLFUCache
(int capacity)
algorithm/LFU.java:7
MethodLRUCache
(int capacity)
algorithm/LRU.java:5
MethodLogger
Initialize your data structure here.
algorithm/loggerRateLimiter.java:5
MethodMagicDictionary
Initialize your data structure here.
algorithm/implementMagicDictionary.java:5
MethodMedianFinder
initialize your data structure here.
algorithm/findMedianFromDatastream.java:7
MethodMinStack
initialize your data structure here.
algorithm/minStack.java:5
MethodMovingAverage
Initialize your data structure here.
algorithm/movingAverage.java:7
MethodMyQueue
Initialize your data structure here.
algorithm/implementQueueUsingStack.java:6
MethodNestedIterator
(List<NestedInteger> nestedList)
algorithm/flattenNestedListIterator.java:26
MethodNode
(int val, int min)
algorithm/minStack.java:63
MethodNode
(int key, int value)
algorithm/LRU.java:93
MethodNode
(int count)
algorithm/LFU.java:104
MethodNodeContainer
(boolean visited, TreeNode node)
algorithm/binaryTreePostorderTraversal.java:47
MethodNodeContainer
(int pos, TreeNode node)
algorithm/binaryTreeVerticalOrderTraversal.java:107
MethodNumArray
(int[] nums)
algorithm/rangeSumQuery.java:5
MethodNumArray
(int[] nums)
algorithm/rangeSumQuery-mutable.java:5
MethodNumMatrix
(int[][] matrix)
algorithm/rangeSumQuery2D-immutable.java:3
MethodPair
(int x, int y, int sum)
algorithm/findKPairsWithSmallestSum.java:26
MethodPeekingIterator
(Iterator<Integer> iterator)
algorithm/peekingIterator.java:6
MethodPhoneDirectory
Initialize your data structure here @param maxNumbers - The maximum numbers that can be stored in the phone directory.
algorithm/designPhoneDictionary.java:7
MethodPoint
(int x, int y)
algorithm/mazeIII.java:44
MethodPoint
(int x, int y, int distance)
algorithm/theMazeII.java:40
MethodRandomizedCollection
Initialize your data structure here.
algorithm/InsertDeleteGetRamdom-AllowDuplicate.java:6
MethodRandomizedSet
Initialize your data structure here.
algorithm/InsertDeleteGetRamdom.java:8
MethodSolution
(int[] nums)
algorithm/ShuffleAnArray.java:3
MethodSolution
(ListNode head)
algorithm/linkedListRandomNode.java:24
MethodTicTacToe
Initialize your data structure here.
algorithm/designTicTacToe.java:11
MethodTrie
Initialize your data structure here.
algorithm/implementTrie(prefix)Tree.java:7
MethodTrieNode
()
algorithm/implementTrie(prefix)Tree.java:53
MethodTrieNode
()
algorithm/wordSearchII.java:52
MethodTrieNode
()
algorithm/replacesWords.java:69
MethodTrieNode
()
algorithm/addAndSearchWord.java:96
MethodTweet
(int id)
algorithm/designTwitter.java:89
MethodTwitter
Initialize your data structure here.
algorithm/designTwitter.java:8
MethodTwoSum
Initialize your data structure here.
algorithm/twoSum-Design.java:4
MethodUser
(int userId)
algorithm/designTwitter.java:67
MethodValidWordAbbr
(String[] dictionary)
algorithm/uniqueWordAbbreviation.java:3
MethodWordDictionary
Initialize your data structure here.
algorithm/addAndSearchWord.java:5
MethodWordDistance
(String[] words)
algorithm/shortestWordDistanceII.java:3
MethodZigzagIterator
(List<Integer> v1, List<Integer> v2)
algorithm/zigZagIterator.java:4
MethodaddBinary
(String a, String b)
algorithm/addBinary.java:16
MethodaddDigits
(int num)
algorithm/addDigit.java:17
MethodaddNum
(int num)
algorithm/findMedianFromDatastream.java:12
MethodaddOneRow
(TreeNode root, int v, int d)
algorithm/addOneRowToTree.java:6
MethodaddOperators
(String num, int target)
algorithm/expressionAddOperator.java:3
MethodaddStrings
(String num1, String num2)
algorithm/addStrings.java:12
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
algorithm/addTwoNumbersII.java:18
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
algorithm/addTwoNumbersII.java:49
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
algorithm/addTwoNumbers.java:16
MethodaddWord
Adds a word into the data structure.
algorithm/addAndSearchWord.java:10
MethodalienOrder
(String[] words)
algorithm/alienDictionary.java:3
MethodarrayNesting
(int[] nums)
algorithm/ArrayNesting.java:22
MethodarrayPairSum
(int[] nums)
algorithm/arrayPartitionI.java:15
MethodbinaryTreePaths
(TreeNode root)
algorithm/binaryTreePaths.java:21
MethodbinaryTreePaths
(TreeNode root)
algorithm/binaryTreePaths.java:57
MethodboundaryOfBinaryTree
(TreeNode root)
algorithm/boundaryOfBinaryTree.java:25
MethodbuildDict
Build a dictionary through a list of words
algorithm/implementMagicDictionary.java:10
MethodbuildTree
(int[] inorder, int[] postorder)
algorithm/constructBinaryTreeInorderPostorder.java:3
MethodbuildTree
(int[] preorder, int[] inorder)
algorithm/constructBinaryTreePreorderInorder.java:4
MethodbulbSwitch
(int n)
algorithm/bulbSwitch.java:28
Methodcalculate
(String s)
algorithm/basicCalculatorII.java:11
Methodcalculate
(String s)
algorithm/basicCalculator.java:7
MethodcalculateMinimumHP
(int[][] dungeon)
algorithm/dungeonGame.java:8
MethodcanAttendMeetings
(Interval[] intervals)
algorithm/meetingRooms.java:4
MethodcanCompleteCircuit
(int[] gas, int[] cost)
algorithm/gasStation.java:18
MethodcanConstruct
(String ransomNote, String magazine)
algorithm/ransomNote.java:2
MethodcanCross
(int[] stones)
algorithm/frogJump.java:4
MethodcanFinish
(int numCourses, int[][] prerequisites)
algorithm/courseScheduleI.java:10
MethodcanIWin
(int maxChoosableInteger, int desiredTotal)
algorithm/canIWin.java:13
MethodcanJump
(int[] nums)
algorithm/jumpGame.java:2
MethodcanMeasureWater
(int x, int y, int z)
algorithm/waterAndJugProblem.java:7
MethodcanPartitionKSubsets
(int[] nums, int k)
algorithm/partitionToKEqualSumSubsets.java:3
MethodcanWin
(String s)
algorithm/flipGameII.java:5
MethodcanWinNim
(int n)
algorithm/nimGame.java:4
Methodcandy
(int[] ratings)
algorithm/candy.java:2
Methodcheck
Check if a number is available or not.
algorithm/designPhoneDictionary.java:31
MethodcheckPossibility
(int[] nums)
algorithm/non-decreasingArray.java:2
MethodcheckRecord
(int n)
algorithm/studentAttendanceRecord.java:22
MethodcheckSubarraySum
(int[] nums, int k)
algorithm/continuousSubArraySum.java:4
MethodclimbStairs
(int n)
algorithm/climbingStairs.java:3
MethodcloneGraph
(UndirectedGraphNode node)
algorithm/cloneGraph.java:11
MethodclosestKValues
(TreeNode root, double target, int k)
algorithm/closestBinarySearchTreeValueII.java:7
MethodclosestValue
(TreeNode root, double target)
algorithm/closestBSTValue.java:7
MethodcombinationSum
(int[] candidates, int target)
algorithm/combinationSum.java:5
← previousnext →201–300 of 771, ranked by callers