Functions — github.com/corpsepiges/leetcode

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940

↓ 1 callersMethodisVail

:type strs: List[str] :rtype: bool

Algorithms/331. Verify Preorder Serialization of a Binary Tree/Solution.py:11

↓ 1 callersMethodisValid

(List<String> list)

Algorithms/331. Verify Preorder Serialization of a Binary Tree/Solution.java:10

↓ 1 callersMethodisValid

(List<String> list)

java/331. Verify Preorder Serialization of a Binary Tree.java:10

↓ 1 callersMethodisZero

(int[] b)

Algorithms/372. Super Pow/Solution.java:20

↓ 1 callersMethodisZero

(int[] b)

java/372. Super Pow.java:20

↓ 1 callersFunctionis_same

(left,right)

Algorithms/101. Symmetric Tree/Solution.rb:16

↓ 1 callersFunctionis_same

(left,right)

ruby/101. Symmetric Tree.rb:16

↓ 1 callersFunctionis_valid

(root, min, max)

Algorithms/098. Validate Binary Search Tree/Solution.rb:16

↓ 1 callersFunctionis_valid

(root, min, max)

ruby/098. Validate Binary Search Tree.rb:16

↓ 1 callersMethodleft

求左侧 @param height @param a @return

Algorithms/042. Trapping Rain Water/Solution.java:34

↓ 1 callersMethodleft

求左侧 @param height @param a @return

java/042. Trapping Rain Water.java:34

↓ 1 callersMethodlengthOfLongestSubstring

:type s: str :rtype: int

python/003. Longest Substring Without Repeating Characters.py:4

↓ 1 callersMethodlengthOfLongestSubstring

:type s: str :rtype: int

Algorithms/003. Longest Substring Without Repeating Characters/Solution.py:4

↓ 1 callersMethodlow

(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)

Algorithms/054. Spiral Matrix/Solution.java:47

↓ 1 callersMethodlow

(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)

java/054. Spiral Matrix.java:47

↓ 1 callersMethodmaxNodeVal

(self,root)

python/098. Validate Binary Search Tree.py:21

↓ 1 callersMethodmaxNodeVal

(self,root)

Algorithms/098. Validate Binary Search Tree/Solution.py:21

↓ 1 callersMethodmerge

(ListNode a,ListNode b)

Algorithms/148. Sort List/Solution.java:28

↓ 1 callersMethodmerge

(ListNode a,ListNode b)

java/148. Sort List.java:28

↓ 1 callersMethodminNodeVal

(self,root)

python/098. Validate Binary Search Tree.py:28

↓ 1 callersMethodminNodeVal

(self,root)

Algorithms/098. Validate Binary Search Tree/Solution.py:28

↓ 1 callersMethodn2w

(self,num)

python/273. Integer to English Words.py:28

↓ 1 callersMethodn2w

(self,num)

Algorithms/273. Integer to English Words/Solution.py:28

↓ 1 callersMethodpay

(int[][] matrix,int s,int e)

Algorithms/375. Guess Number Higher or Lower II/Solution.java:6

↓ 1 callersMethodpay

(int[][] matrix,int s,int e)

java/375. Guess Number Higher or Lower II.java:6

↓ 1 callersMethodpostorder

(TreeNode root,List<Integer> list)

Algorithms/145. Binary Tree Postorder Traversal/Solution.java:15

↓ 1 callersMethodpostorder

(TreeNode root,List<Integer> list)

java/145. Binary Tree Postorder Traversal.java:15

↓ 1 callersMethodpre

粗略判断，判断字符串中的每个字符是否出现在表格上以及下一个字符是否在该字符周围可以找到 @author xuxuan @date 2015-11-4下午04:23:28 @param word @return

Algorithms/212. Word Search II/Solution.java:23

↓ 1 callersMethodpre

粗略判断，判断字符串中的每个字符是否出现在表格上以及下一个字符是否在该字符周围可以找到 @author xuxuan @date 2015-11-4下午04:23:28 @param word @return

java/212. Word Search II.java:23

↓ 1 callersMethodpreorder

(TreeNode root,List<Integer> list)

Algorithms/144. Binary Tree Preorder Traversal/Solution.java:15

↓ 1 callersMethodpreorder

(TreeNode root,List<Integer> list)

java/144. Binary Tree Preorder Traversal.java:15

↓ 1 callersMethodqueryTree

(TreeNode node,int start,int end)

Algorithms/307. Range Sum Query - Mutable/Solution.java:53

↓ 1 callersMethodqueryTree

(TreeNode node,int start,int end)

java/307. Range Sum Query - Mutable.java:53

↓ 1 callersMethodreadNum

(String num)

Algorithms/038. Count and Say/Solution.java:13

↓ 1 callersMethodreadNum

(String num)

java/038. Count and Say.java:13

↓ 1 callersFunctionremove_nth_from_start

(head,n)

Algorithms/019. Remove Nth Node From End of List/Solution.rb:23

↓ 1 callersFunctionremove_nth_from_start

(head,n)

ruby/019. Remove Nth Node From End of List.rb:23

↓ 1 callersMethodright

求右侧 @param height @param a @return

Algorithms/042. Trapping Rain Water/Solution.java:67

↓ 1 callersMethodright

求右侧 @param height @param a @return

java/042. Trapping Rain Water.java:67

↓ 1 callersMethodsearch

(self,nums,s,e,target)

python/034. Search for a Range.py:12

↓ 1 callersMethodsearch

(String word)

Algorithms/208. Implement Trie (Prefix Tree)/Solution.java:44

↓ 1 callersMethodsearch

(self,nums,s,e,target)

Algorithms/034. Search for a Range/Solution.py:12

↓ 1 callersMethodsearch

(String word)

java/208. Implement Trie (Prefix Tree).java:44

↓ 1 callersMethodset

:type key: int :type value: int :rtype: nothing

python/146. LRU Cache.py:27

↓ 1 callersMethodset

(int key, int value)

Algorithms/146. LRU Cache/Solution.java:19

↓ 1 callersMethodsolveNQueens

(int n)

Algorithms/052. N-Queens II/Solution.java:6

↓ 1 callersMethodsolveNQueens

(int n)

java/052. N-Queens II.java:6

↓ 1 callersMethodss

(Map<String,String> map,int i,int j,char[][] grid)

Algorithms/200. Number of Islands/Solution.java:17

↓ 1 callersMethodss

(Map<String,String> map,int i,int j,char[][] grid)

java/200. Number of Islands.java:17

↓ 1 callersMethodsum

(List<Integer> list)

Algorithms/216. Combination Sum III/Solution.java:32

↓ 1 callersMethodsum

(List<Integer> list)

java/216. Combination Sum III.java:32

↓ 1 callersMethodthreeSum

:type nums: List[int] :rtype: List[List[int]]

python/015. 3Sum.py:4

↓ 1 callersMethodthreeSum

:type nums: List[int] :rtype: List[List[int]]

Algorithms/015. 3Sum/Solution.py:4

↓ 1 callersMethodtransfer

(int n,int k)

Algorithms/386. Lexicographical Numbers/Solution.java:24

↓ 1 callersMethodtransfer

(int n,int k)

java/386. Lexicographical Numbers.java:24

↓ 1 callersMethodup

(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)

Algorithms/054. Spiral Matrix/Solution.java:53

↓ 1 callersMethodup

(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)

java/054. Spiral Matrix.java:53

↓ 1 callersMethodupdateTree

(TreeNode node,int index,int val)

Algorithms/307. Range Sum Query - Mutable/Solution.java:33

↓ 1 callersMethodupdateTree

(TreeNode node,int index,int val)

java/307. Range Sum Query - Mutable.java:33

↓ 1 callersMethodvalidate

(String s,int[] a)

Algorithms/093. Restore IP Addresses/Solution.java:19

↓ 1 callersMethodvalidate

(String s,int[] a)

java/093. Restore IP Addresses.java:19

↓ 1 callersMethodzuhe

(ListNode head,List<ListNode> list)

Algorithms/206. Reverse Linked List/Solution.java:22

↓ 1 callersMethodzuhe

(ListNode head, List<ListNode> list)

Algorithms/143. Reorder List/Solution.java:21

↓ 1 callersMethodzuhe

(ListNode head,List<ListNode> list, int val)

Algorithms/203. Remove Linked List Elements/Solution.java:22

↓ 1 callersMethodzuhe

(ListNode head,List<ListNode> list, int val)

java/203. Remove Linked List Elements.java:22

↓ 1 callersMethodzuhe

(ListNode head, List<ListNode> list)

java/143. Reorder List.java:21

↓ 1 callersMethodzuhe

(ListNode head,List<ListNode> list)

java/206. Reverse Linked List.java:22

↓ 1 callersMethodzuheB

(ListNode head,List<ListNode> list,int x)

Algorithms/086. Partition List/Solution.java:37

↓ 1 callersMethodzuheB

(ListNode head,List<ListNode> list,int x)

java/086. Partition List.java:37

↓ 1 callersMethodzuheL

(ListNode head,List<ListNode> list,int x)

Algorithms/086. Partition List/Solution.java:28

↓ 1 callersMethodzuheL

(ListNode head,List<ListNode> list,int x)

java/086. Partition List.java:28

MethodBSTIterator

(TreeNode root)

Algorithms/173. Binary Search Tree Iterator/Solution.java:13

MethodBSTIterator

(TreeNode root)

java/173. Binary Search Tree Iterator.java:13

MethodLRUCache

(int capacity)

Algorithms/146. LRU Cache/Solution.java:5

MethodLRUCache

(int capacity)

java/146. LRU Cache.java:5

MethodNestedIterator

(List<NestedInteger> nestedList)

Algorithms/341. Flatten Nested List Iterator/Solution.java:23

MethodNestedIterator

(List<NestedInteger> nestedList)

java/341. Flatten Nested List Iterator.java:23

MethodNodeFile

(String name)

Algorithms/388. Longest Absolute File Path/Solution.java:6

MethodNodeFile

(String name)

java/388. Longest Absolute File Path.java:6

MethodNumArray

(int[] nums)

Algorithms/303. Range Sum Query - Immutable/Solution.java:3

MethodNumArray

(int[] nums)

Algorithms/307. Range Sum Query - Mutable/Solution.java:10

MethodNumArray

(int[] nums)

java/303. Range Sum Query - Immutable.java:3

MethodNumArray

(int[] nums)

java/307. Range Sum Query - Mutable.java:10

MethodPeekingIterator

(Iterator<Integer> iterator)

Algorithms/284. Peeking Iterator/Solution.java:6

MethodPeekingIterator

(Iterator<Integer> iterator)

java/284. Peeking Iterator.java:6

MethodRandomizedCollection

Initialize your data structure here.

Algorithms/381. Insert Delete GetRandom O(1) - Duplicates allowed/Solution.java:6

MethodRandomizedCollection

Initialize your data structure here.

java/381. Insert Delete GetRandom O(1) - Duplicates allowed.java:6

MethodRandomizedSet

Initialize your data structure here.

Algorithms/380. Insert Delete GetRandom O(1)/Solution.java:6

MethodRandomizedSet

Initialize your data structure here.

java/380. Insert Delete GetRandom O(1).java:6

MethodSolution

@param head The linked list's head. Note that the head is guaranteed to be not null, so it contains at least one node.

Algorithms/382. Linked List Random Node/Solution.java:13

MethodSolution

(int[] nums)

Algorithms/398. Random Pick Index/Solution.java:4

MethodSolution

(int[] nums)

Algorithms/384. Shuffle an Array/Solution.java:3

MethodSolution

@param head The linked list's head. Note that the head is guaranteed to be not null, so it contains at least one node.

java/382. Linked List Random Node.java:13

MethodSolution

(int[] nums)

java/384. Shuffle an Array.java:3

MethodSolution

(int[] nums)

java/398. Random Pick Index.java:4

MethodSummaryRanges

Initialize your data structure here.

Algorithms/352. Data Stream as Disjoint Intervals/Solution.java:16

MethodSummaryRanges

Initialize your data structure here.

java/352. Data Stream as Disjoint Intervals.java:16

MethodTrie

()

Algorithms/208. Implement Trie (Prefix Tree)/Solution.java:14

MethodTrie

()

java/208. Implement Trie (Prefix Tree).java:14

MethodTrieNode

(char x)

Algorithms/208. Implement Trie (Prefix Tree)/Solution.java:6

← previous next →301–400 of 1,433, ranked by callers