Functions — github.com/corpsepiges/leetcode

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940

各参数含义 @param board 参照表格 @param ch 测试的字符串转成字符数组 @param level 测试数组的下标 @param x 探测表格的横坐标 @param y 探测表格的纵坐标 @param length数组的长度 @par

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

↓ 1 callersMethodf

(self,num,state)

Algorithms/051. N-Queens/Solution.py:16

↓ 1 callersMethodf

(int[] nums,int x,int val)

Algorithms/051. N-Queens/Solution.java:57

↓ 1 callersMethodf

(int n,Map<Integer,Integer> map)

Algorithms/096. Unique Binary Search Trees/Solution.java:5

↓ 1 callersMethodf

(self,node)

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

↓ 1 callersMethodf

(UndirectedGraphNode node,Map<UndirectedGraphNode, Integer> map)

Algorithms/133. Clone Graph/Solution.java:40

↓ 1 callersMethodf

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

Algorithms/230. Kth Smallest Element in a BST/Solution.py:18

↓ 1 callersMethodf

(TreeNode root)

Algorithms/230. Kth Smallest Element in a BST/Solution.java:21

↓ 1 callersMethodf

(int n,boolean flag)

java/390. Elimination Game.java:6

↓ 1 callersMethodf

(int[] nums,int x,int val)

java/051. N-Queens.java:57

↓ 1 callersMethodf

(int[] nums,int s,int m,int e,int target)

java/016. 3Sum Closest.java:16

↓ 1 callersMethodf

(int x,int y,int d)

java/329. Longest Increasing Path in a Matrix.java:29

↓ 1 callersMethodf

(String s,Map<String,Integer> map)

java/091. Decode Ways.java:9

↓ 1 callersMethodf

(UndirectedGraphNode node,Map<UndirectedGraphNode, Integer> map)

java/133. Clone Graph.java:40

↓ 1 callersMethodf

(int[][] obstacleGrid,int x,int y,int xl,int yl,Map<String,Integer> map)

java/063. Unique Paths II.java:9

↓ 1 callersMethodf

(int[] candidates, int target,int l)

java/040. Combination Sum II.java:6

↓ 1 callersMethodf

(int i,int j)

java/318. Maximum Product of Word Lengths.java:52

↓ 1 callersMethodf

(List<Integer> list)

java/047. Permutations II.java:11

↓ 1 callersMethodf

(char[][] board,char[] ch,int level,int x,int y,int length,int m,int n,boolean[][] flag)

java/079. Word Search.java:20

↓ 1 callersMethodf

(String s, Set<String> wordDict,Map<String, Boolean> map)

java/139. Word Break.java:5

↓ 1 callersMethodf

(int n)

java/343. Integer Break.java:16

↓ 1 callersMethodf

(int[] candidates, int target,HashMap<Integer, List<List<Integer>>> map)

java/039. Combination Sum.java:6

↓ 1 callersMethodf

(int n)

java/397. Integer Replacement.java:8

↓ 1 callersMethodf

(int amount)

java/322. Coin Change.java:11

↓ 1 callersMethodf

(TreeNode root)

java/114. Flatten Binary Tree to Linked List.java:22

↓ 1 callersMethodf

(int[] nums,int target,int s,int e)

java/015. 3Sum.java:16

↓ 1 callersMethodf

java/212. Word Search II.java:94

↓ 1 callersMethodf

(String s1, String s2, String s3,Map<String,Boolean> map)

java/097. Interleaving String.java:5

↓ 1 callersMethodf

(String first,String second,String third)

java/306. Additive Number.java:22

↓ 1 callersMethodf

(int[] nums, int target,int s,int m,int n,int e)

java/018. 4Sum.java:18

↓ 1 callersMethodf

(TreeNode root)

java/230. Kth Smallest Element in a BST.java:21

↓ 1 callersMethodf

(int n,Map<Integer,Integer> map)

java/096. Unique Binary Search Trees.java:5

↓ 1 callersMethodf

(ListNode head,List<ListNode> list)

java/092. Reverse Linked List II.java:23

↓ 1 callersMethodf

(int s,int e,Map<String,List<TreeNode>> map)

java/095. Unique Binary Search Trees II.java:14

↓ 1 callersMethodf

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

java/287. Find the Duplicate Number.java:5

↓ 1 callersMethodf

(int n)

java/300. Longest Increasing Subsequence.java:11

↓ 1 callersMethodf

(ListNode head,ListNode end)

java/109. Convert Sorted List to Binary Search Tree.java:22

↓ 1 callersMethodf

(int[][] grid,int x,int y,int xl,int yl,Map<String, Integer> map)

java/064. Minimum Path Sum.java:8

↓ 1 callersMethodf

(int[] nums,int x,int val)

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

↓ 1 callersMethodf

()

java/316. Remove Duplicate Letters.java:29

↓ 1 callersMethodf

(String str,Map<String, String> map)

java/273. Integer to English Words.java:85

↓ 1 callersMethodf

(ListNode node)

java/234. Palindrome Linked List.java:32

↓ 1 callersMethodf

(int startIndex,int step)

java/403. Frog Jump.java:14

↓ 1 callersMethodf

(int[][] board,int x,int y)

java/289. Game of Life.java:21

↓ 1 callersMethodfinMax

(self,nums)

python/179. Largest Number.py:24

↓ 1 callersMethodfinMax

(self,nums)

Algorithms/179. Largest Number/Solution.py:24

↓ 1 callersMethodfindFirst

(ListNode head)

Algorithms/082. Remove Duplicates from Sorted List II/Solution.java:17

↓ 1 callersMethodfindFirst

(ListNode head)

java/082. Remove Duplicates from Sorted List II.java:17

↓ 1 callersMethodfindIndex

(self,num,arrays)

python/315. Count of Smaller Numbers After Self.py:20

↓ 1 callersMethodfindIndex

(self,num,arrays)

Algorithms/315. Count of Smaller Numbers After Self/Solution.py:20

↓ 1 callersMethodfindKthLargest

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

python/324. Wiggle Sort II.py:29

↓ 1 callersMethodfindKthLargest

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

Algorithms/324. Wiggle Sort II/Solution.py:29

↓ 1 callersMethodfindMax

(TreeNode root,boolean flag)

Algorithms/124. Binary Tree Maximum Path Sum/Solution.java:16

↓ 1 callersMethodfindMax

(TreeNode root,boolean flag)

java/124. Binary Tree Maximum Path Sum.java:16

↓ 1 callersMethodfindMistakes

(self,root)

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

↓ 1 callersMethodfindMistakes

(self,root)

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

↓ 1 callersMethodfindSameWord

(self,str1,str2)

python/014. Longest Common Prefix.py:16

↓ 1 callersMethodfindSameWord

(self,str1,str2)

Algorithms/014. Longest Common Prefix/Solution.py:16

↓ 1 callersMethodflat

:type nestedList: List[NestedInteger] :rtype: List<Integer>

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

↓ 1 callersMethodflat

:type nestedList: List[NestedInteger] :rtype: List<Integer>

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

↓ 1 callersMethodg

(List<Integer> list)

Algorithms/047. Permutations II/Solution.java:37

↓ 1 callersMethodg

(List<Integer> list)

java/047. Permutations II.java:37

↓ 1 callersMethodgcd

(int x,int y)

Algorithms/365. Water and Jug Problem/Solution.java:5

↓ 1 callersMethodgcd

(int x,int y)

java/365. Water and Jug Problem.java:5

↓ 1 callersMethodgetArticleUrl

(self)

util/csdn.py:98

↓ 1 callersMethodgetEndNode

(self,head)

python/061. Rotate List.py:36

↓ 1 callersMethodgetEndNode

(self,head)

Algorithms/061. Rotate List/Solution.py:36

↓ 1 callersMethodgetLeft

(TreeNode root)

Algorithms/222. Count Complete Tree Nodes/Solution.java:22

↓ 1 callersMethodgetLeft

(TreeNode root)

java/222. Count Complete Tree Nodes.java:22

↓ 1 callersMethodgetLength

(self,head)

python/061. Rotate List.py:30

↓ 1 callersMethodgetLength

(self,head)

Algorithms/061. Rotate List/Solution.py:30

↓ 1 callersMethodgetMid

(ListNode head)

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

↓ 1 callersMethodgetMid

(ListNode head)

java/148. Sort List.java:19

↓ 1 callersMethodgetRight

(TreeNode root)

Algorithms/222. Count Complete Tree Nodes/Solution.java:30

↓ 1 callersMethodgetRight

(TreeNode root)

java/222. Count Complete Tree Nodes.java:30

↓ 1 callersMethodguessRange

(int start,int end)

Algorithms/374. Guess Number Higher or Lower/Solution.java:10

↓ 1 callersMethodguessRange

(int start,int end)

java/374. Guess Number Higher or Lower.java:10

↓ 1 callersMethodhalf

(int[] b)

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

↓ 1 callersMethodhalf

(int[] b)

java/372. Super Pow.java:12

↓ 1 callersMethodhasNext

()

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

↓ 1 callersMethodhasNext

()

java/284. Peeking Iterator.java:27

↓ 1 callersMethodhasSameChars

(self,s1,s2)

python/087. Scramble String.py:21

↓ 1 callersMethodhasSameChars

(self,s1,s2)

Algorithms/087. Scramble String/Solution.py:21

↓ 1 callersMethodinit

(List<NestedInteger> nestedList)

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

↓ 1 callersMethodinit

预处理，先把每个字符周围的值写进map @param board

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

↓ 1 callersMethodinit

预处理，先把每个字符周围的值写进map @param board

java/212. Word Search II.java:38

↓ 1 callersMethodinit

(List<NestedInteger> nestedList)

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

↓ 1 callersMethodinorder

(TreeNode root,List<Integer> list)

Algorithms/098. Validate Binary Search Tree/Solution.java:26

↓ 1 callersMethodinorder

(TreeNode root,List<Integer> list)

Algorithms/094. Binary Tree Inorder Traversal/Solution.java:14

↓ 1 callersMethodinorder

(TreeNode root,List<Integer> list)

java/098. Validate Binary Search Tree.java:26

↓ 1 callersMethodinorder

(TreeNode root,List<Integer> list)

java/094. Binary Tree Inorder Traversal.java:14

↓ 1 callersMethodisLive

(self,m,n)

python/289. Game of Life.py:36

↓ 1 callersMethodisLive

(self,m,n)

Algorithms/289. Game of Life/Solution.py:36

↓ 1 callersMethodisStraight

(Point a,Point b,Point c)

Algorithms/149. Max Points on a Line/Solution.java:43

↓ 1 callersMethodisStraight

(Point a,Point b,Point c)

java/149. Max Points on a Line.java:43

↓ 1 callersMethodisSy

(TreeNode p,TreeNode q)

Algorithms/101. Symmetric Tree/Solution.java:20

↓ 1 callersMethodisSy

(TreeNode p,TreeNode q)

java/101. Symmetric Tree.java:20

↓ 1 callersMethodisTrue

(self,first,second,other)

python/306. Additive Number.py:19

↓ 1 callersMethodisTrue

(self,first,second,other)

Algorithms/306. Additive Number/Solution.py:19

↓ 1 callersMethodisVail

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

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

← previous next →201–300 of 1,433, ranked by callers