Functions — github.com/corpsepiges/leetcode

CodeHub MCPcopy Create free account

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940

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

Initialize your data structure here.

Algorithms/355. Design Twitter/Solution.java:6

Initialize your data structure here.

java/355. Design Twitter.java:6

:type capacity: int

python/146. LRU Cache.py:7

python/086. Partition List.py:10

(self, s=0, e=0)

python/057. Insert Interval.py:5

python/023. Merge k Sorted Lists.py:4

initialize your data structure here. :type nums: List[int]

python/303. Range Sum Query - Immutable.py:5

python/099. Recover Binary Search Tree.py:5

python/109. Convert Sorted List to Binary Search Tree.py:5

python/109. Convert Sorted List to Binary Search Tree.py:11

initialize your data structure here. :type matrix: List[List[int]]

python/304. Range Sum Query 2D - Immutable.py:5

python/328. Odd Even Linked List.py:5

python/107. Binary Tree Level Order Traversal II.py:5

python/106. Construct Binary Tree from Inorder and Postorder Traversal.py:5

python/235. Lowest Common Ancestor of a Binary Search Tree.py:5

python/143. Reorder List.py:5

python/103. Binary Tree Zigzag Level Order Traversal.py:5

python/096. Unique Binary Search Trees.py:4

python/120. Triangle.py:4

python/105. Construct Binary Tree from Preorder and Inorder Traversal.py:5

Initialize your data structure here. :type nestedList: List[NestedInteger]

python/341. Flatten Nested List Iterator.py:32

python/148. Sort List.py:5

python/002. Add Two Numbers.py:5

python/133. Clone Graph.py:5

Algorithms/107. Binary Tree Level Order Traversal II/Solution.py:5

Algorithms/328. Odd Even Linked List/Solution.py:5

Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.py:5

initialize your data structure here. :type nums: List[int]

Algorithms/303. Range Sum Query - Immutable/Solution.py:5

Algorithms/109. Convert Sorted List to Binary Search Tree/Solution.py:5

Algorithms/109. Convert Sorted List to Binary Search Tree/Solution.py:11

Initialize your data structure here. :type nestedList: List[NestedInteger]

Algorithms/341. Flatten Nested List Iterator/Solution.py:32

Algorithms/143. Reorder List/Solution.py:5

Algorithms/086. Partition List/Solution.py:10

initialize your data structure here. :type matrix: List[List[int]]

Algorithms/304. Range Sum Query 2D - Immutable/Solution.py:5

Algorithms/120. Triangle/Solution.py:4

Algorithms/023. Merge k Sorted Lists/Solution.py:4

:type capacity: int

Algorithms/146. LRU Cache/Solution.py:7

Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.py:5

Algorithms/103. Binary Tree Zigzag Level Order Traversal/Solution.py:5

Algorithms/099. Recover Binary Search Tree/Solution.py:5

Algorithms/148. Sort List/Solution.py:5

Algorithms/002. Add Two Numbers/Solution.py:5

(self, s=0, e=0)

Algorithms/057. Insert Interval/Solution.py:5

Algorithms/096. Unique Binary Search Trees/Solution.py:4

Algorithms/133. Clone Graph/Solution.py:5

Algorithms/235. Lowest Common Ancestor of a Binary Search Tree/Solution.py:5

(self,i,n,u,b,d)

util/spider.py:18

util/spider.py:32

util/csdn.py:24

MethodaddBinary

:type a: str :type b: str :rtype: str

python/067. Add Binary.py:4

MethodaddBinary

:type a: str :type b: str :rtype: str

Algorithms/067. Add Binary/Solution.py:4

MethodaddBinary

(String a, String b)

Algorithms/067. Add Binary/Solution.java:2

MethodaddBinary

(String a, String b)

java/067. Add Binary.java:2

MethodaddDigits

:type num: int :rtype: int

python/258. Add Digits.py:4

MethodaddDigits

:type num: int :rtype: int

Algorithms/258. Add Digits/Solution.py:4

MethodaddDigits

Algorithms/258. Add Digits/Solution.java:2

MethodaddDigits

java/258. Add Digits.java:2

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

Algorithms/295. Find Median from Data Stream/Solution.java:4

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

java/295. Find Median from Data Stream.java:4

MethodaddStrings

(String num1, String num2)

Algorithms/415. Add Strings/Solution.java:2

MethodaddStrings

(String num1, String num2)

java/415. Add Strings.java:2

FunctionaddTwoNumbers

Algorithms/002. Add Two Numbers/Solution.js:13

FunctionaddTwoNumbers

js/002. Add Two Numbers.js:13

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

Algorithms/002. Add Two Numbers/Solution.java:10

MethodaddTwoNumbers

(ListNode l1, ListNode l2)

java/002. Add Two Numbers.java:10

Functionadd_two_numbers

@param {ListNode} l1 @param {ListNode} l2 @return {ListNode}

Algorithms/002. Add Two Numbers/Solution.rb:13

Functionadd_two_numbers

@param {ListNode} l1 @param {ListNode} l2 @return {ListNode}

ruby/002. Add Two Numbers.rb:13

MethodbinaryTreePaths

:type root: TreeNode :rtype: List[str]

python/257. Binary Tree Paths.py:11

MethodbinaryTreePaths

:type root: TreeNode :rtype: List[str]

Algorithms/257. Binary Tree Paths/Solution.py:11

MethodbinaryTreePaths

(TreeNode root)

Algorithms/257. Binary Tree Paths/Solution.java:11

MethodbinaryTreePaths

(TreeNode root)

java/257. Binary Tree Paths.java:11

MethodbuildTree

:type inorder: List[int] :type postorder: List[int] :rtype: TreeNode

python/106. Construct Binary Tree from Inorder and Postorder Traversal.py:11

MethodbuildTree

:type inorder: List[int] :type postorder: List[int] :rtype: TreeNode

python/105. Construct Binary Tree from Preorder and Inorder Traversal.py:11

MethodbuildTree

:type inorder: List[int] :type postorder: List[int] :rtype: TreeNode

Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.py:11

MethodbuildTree

(int[] preorder, int[] inorder)

Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.java:11

MethodbuildTree

:type inorder: List[int] :type postorder: List[int] :rtype: TreeNode

Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.py:11

MethodbuildTree

(int[] inorder, int[] postorder)

Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.java:11

MethodbuildTree

(int[] preorder, int[] inorder)

java/105. Construct Binary Tree from Preorder and Inorder Traversal.java:11

MethodbuildTree

(int[] inorder, int[] postorder)

java/106. Construct Binary Tree from Inorder and Postorder Traversal.java:11

Functionbuild_tree

@param {Integer[]} preorder @param {Integer[]} inorder @return {TreeNode}

Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.rb:13

Functionbuild_tree

@param {Integer[]} inorder @param {Integer[]} postorder @return {TreeNode}

Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.rb:13

Functionbuild_tree

@param {Integer[]} preorder @param {Integer[]} inorder @return {TreeNode}

ruby/105. Construct Binary Tree from Preorder and Inorder Traversal.rb:13

Functionbuild_tree

@param {Integer[]} inorder @param {Integer[]} postorder @return {TreeNode}

ruby/106. Construct Binary Tree from Inorder and Postorder Traversal.rb:13

MethodbulbSwitch

:type n: int :rtype: int

python/319. Bulb Switcher.py:5

MethodbulbSwitch

:type n: int :rtype: int

Algorithms/319. Bulb Switcher/Solution.py:5

MethodbulbSwitch

Algorithms/319. Bulb Switcher/Solution.java:2

MethodbulbSwitch

java/319. Bulb Switcher.java:2

MethodcanCompleteCircuit

:type gas: List[int] :type cost: List[int] :rtype: int

python/134. Gas Station.py:4

MethodcanCompleteCircuit

:type gas: List[int] :type cost: List[int] :rtype: int

Algorithms/134. Gas Station/Solution.py:4

MethodcanCompleteCircuit

(int[] gas, int[] cost)

Algorithms/134. Gas Station/Solution.java:2

MethodcanCompleteCircuit

(int[] gas, int[] cost)

java/134. Gas Station.java:2

MethodcanConstruct

(String ransomNote, String magazine)

Algorithms/383. Ransom Note/Solution.java:2

MethodcanConstruct

(String ransomNote, String magazine)

java/383. Ransom Note.java:2

Algorithms/403. Frog Jump/Solution.java:4

java/403. Frog Jump.java:4

FunctioncanJump

Algorithms/055. Jump Game/Solution.js:5

FunctioncanJump

js/055. Jump Game.js:5

← previous next →401–500 of 1,433, ranked by callers