Functions — github.com/LjyYano/LeetCode

hub / github.com/LjyYano/LeetCode / functions

Functions1,125 in github.com/LjyYano/LeetCode

⨍ Functions 1,125◇ Types & classes 459

↓ 4 callersMethodprintList

(ListNode head)

src/main/java/L0143_ReorderList.java:111

↓ 4 callersMethodprintMatrix

(int[][] matrix)

src/main/java/L0048_RotateImage.java:47

↓ 4 callersMethodprintMatrix

(int[][] matrix)

src/main/java/L0073_SetMatrixZeroes.java:86

↓ 4 callersMethodprune

(PriorityQueue<Integer> heap)

src/main/java/L0480_SlidingWindowMedian.java:74

↓ 4 callersMethodpush

将元素 x 推到队列的末尾直接压入 stackIn 即可

src/main/java/L0232_ImplementQueueUsingStacks.java:55

↓ 4 callersMethodremoveDuplicateLetters

(String s)

src/main/java/L0316_RemoveDuplicateLetters.java:21

↓ 4 callersMethodremoveDuplicates

(int[] nums)

src/main/java/L0026_RemoveDuplicatesFromSortedArray.java:13

↓ 4 callersMethodremoveElement

(int[] nums, int val)

src/main/java/L0027_RemoveElement.java:10

↓ 4 callersMethodreverseKGroup

(ListNode head, int k)

src/main/java/L0025_ReverseNodesInKGroup.java:12

↓ 4 callersMethodsearch

如果字符串 word 在前缀树中，返回 true；否则，返回 false

src/main/java/L0208_Trie.java:74

↓ 4 callersMethodsearchInsert

(int[] nums, int target)

src/main/java/L0035_SearchInsertPosition.java:26

↓ 4 callersMethodserialize

(TreeNode root)

src/main/java/L0449_SerializeAndDeserializeBst.java:28

↓ 4 callersMethodsimplifyPath

(String path)

src/main/java/L0071_SimplifyPath.java:43

↓ 4 callersMethodstrStr

(String haystack, String needle)

src/main/java/L0028_FindTheIndexOfTheFirstOccurrenceInAString.java:45

↓ 4 callersMethodstrongPasswordChecker

(String password)

src/main/java/L0420_StrongPasswordChecker.java:32

↓ 4 callersMethodsumRange

(int left, int right)

src/main/java/L0307_RangeSumQueryMutable.java:121

↓ 4 callersMethodsuperPow

计算 a^b mod 1337，其中 b 是以数组形式给出的大数使用欧拉定理：对于互质的 a 和 n，有 a^φ(n) ≡ 1 (mod n) 1337 = 7 × 191，φ(1337) = φ(7) × φ(191) = 6 × 190 = 1140

src/main/java/L0372_SuperPow.java:37

↓ 4 callersMethodthirdMax

(int[] nums)

src/main/java/L0414_ThirdMaximumNumber.java:26

↓ 4 callersMethoduniquePaths

(int m, int n)

src/main/java/L0062_UniquePaths.java:40

↓ 3 callersMethodaddOperators

(String num, int target)

src/main/java/L0282_ExpressionAddOperators.java:30

↓ 3 callersMethodaddTwoNumbers

同时遍历两个链表，对应位置的数字相加，注意处理进位 @param l1 第一个链表 @param l2 第二个链表 @return 相加后的结果链表

src/main/java/L0002_AddTwoNumbers.java:19

↓ 3 callersMethodaddTwoNumbers

(ListNode l1, ListNode l2)

src/main/java/L0445_AddTwoNumbersII.java:32

↓ 3 callersMethodarrangeCoins

(int n)

src/main/java/L0441_ArrangingCoins.java:19

↓ 3 callersMethodarrayToString

(char[][] board)

src/main/java/L0079_WordSearch.java:107

↓ 3 callersMethodbuildTree

(int[] inorder, int[] postorder)

src/main/java/L0106_ConstructBinaryTreeFromInorderAndPostorderTraversal.java:65

↓ 3 callersMethodbuildTree

(int[] preorder, int[] inorder)

src/main/java/L0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java:65

↓ 3 callersMethodcalculate

(String s)

src/main/java/L0224_BasicCalculator.java:32

↓ 3 callersMethodcalculate

(String s)

src/main/java/L0227_BasicCalculatorII.java:32

↓ 3 callersMethodcanIWin

(int maxChoosableInteger, int desiredTotal)

src/main/java/L0464_CanIWin.java:41

↓ 3 callersMethodcanJump

(int[] nums)

src/main/java/L0055_JumpGame.java:23

↓ 3 callersMethodcanMeasureWater

使用贝祖定理解决水壶问题 ax + by = z 有解当且仅当 z 是 x, y 的最大公约数的倍数

src/main/java/L0365_WaterAndJugProblem.java:42

↓ 3 callersMethodcanPartition

(int[] nums)

src/main/java/L0416_PartitionEqualSubsetSum.java:20

↓ 3 callersMethodcanWinNim

(int n)

src/main/java/L0292_NimGame.java:34

↓ 3 callersMethodcharacterReplacement

(String s, int k)

src/main/java/L0424_LongestRepeatingCharacterReplacement.java:20

↓ 3 callersMethodcheckPerfectNumber

数学方法只需要遍历到 sqrt(num)

src/main/java/L0507_PerfectNumber.java:27

↓ 3 callersMethodcircularArrayLoop

(int[] nums)

src/main/java/L0457_CircularArrayLoop.java:38

↓ 3 callersMethodclimbStairs

(int n)

src/main/java/L0070_ClimbingStairs.java:29

↓ 3 callersMethodclimbStairsOptimized

(int n)

src/main/java/L0070_ClimbingStairs.java:52

↓ 3 callersMethodcloneGraph

(Node node)

src/main/java/L0133_CloneGraph.java:83

↓ 3 callersMethodcombinationSum

(int[] candidates, int target)

src/main/java/L0039_CombinationSum.java:32

↓ 3 callersMethodcombinationSum3

(int k, int n)

src/main/java/L0216_CombinationSumIII.java:42

↓ 3 callersMethodcompareVersion

(String version1, String version2)

src/main/java/L0165_CompareVersionNumbers.java:39

↓ 3 callersMethodcompress

(char[] chars)

src/main/java/L0443_StringCompression.java:34

↓ 3 callersMethodconnect

使用常量空间的解法基本思路是： 1. 利用已建立的 next 指针遍历每一层 2. 同时为下一层建立 next 指针

src/main/java/L0117_PopulatingNextRightPointersInEachNodeII.java:64

↓ 3 callersMethodconnect

使用递归方法填充每个节点的 next 指针对于每个节点，我们需要： 1. 将左子节点的 next 指向右子节点 2. 将右子节点的 next 指向父节点的 next 的左子节点（如果父节点的 next 存在）

src/main/java/L0116_PopulatingNextRightPointersInEachNode.java:63

↓ 3 callersMethodconstructRectangle

从平方根开始向下找最接近的因子

src/main/java/L0492_ConstructTheRectangle.java:36

↓ 3 callersMethodcontainsDuplicate

(int[] nums)

src/main/java/L0217_ContainsDuplicate.java:27

↓ 3 callersMethodcontainsNearbyAlmostDuplicate

(int[] nums, int k, int t)

src/main/java/L0220_ContainsDuplicateIII.java:32

↓ 3 callersMethodcontainsNearbyDuplicate

(int[] nums, int k)

src/main/java/L0219_ContainsDuplicateII.java:29

↓ 3 callersMethodconvert

(String s, int numRows)

src/main/java/L0006_ZigzagConversion.java:13

↓ 3 callersMethodconvertToBase7

进制转换不断除以 7，取余数，直到商为 0

src/main/java/L0504_Base7.java:23

↓ 3 callersMethodcopyRandomList

(Node head)

src/main/java/L0138_CopyListWithRandomPointer.java:53

↓ 3 callersMethodcountDigitOne

计算 1 到 n 中数字 1 出现的次数对于每一位，我们分别计算该位上 1 出现的次数

src/main/java/L0233_NumberOfDigitOne.java:24

↓ 3 callersMethodcountNodes

利用完全二叉树的特性，结合二分查找来统计节点数时间复杂度：O(log^2 n)

src/main/java/L0222_CountCompleteTreeNodes.java:36

↓ 3 callersMethodcountNumbersWithUniqueDigits

使用排列组合的思想解决问题： 1. 当 n = 0 时，只有 0 这一个数字 2. 当 n = 1 时，有 10 个数字（0-9） 3. 当 n = 2 时： - 第一位可以是 1-9（9种选择） - 第二位可以是除第一位外的任意数字（包括0）（9种选择） 4. 当 n = 3 时：

src/main/java/L0357_CountNumbersWithUniqueDigits.java:33

↓ 3 callersMethodcountPrimes

使用埃拉托斯特尼筛法计算小于 n 的质数个数 @param n 目标数字 @return 小于 n 的质数个数

src/main/java/L0204_CountPrimes.java:32

↓ 3 callersMethodcreateTestCase

(int[][] arr)

src/main/java/L0138_CopyListWithRandomPointer.java:80

↓ 3 callersMethoddeleteDuplicates

(ListNode head)

src/main/java/L0083_RemoveDuplicatesFromSortedList.java:30

↓ 3 callersMethoddeleteDuplicates

(ListNode head)

src/main/java/L0082_RemoveDuplicatesFromSortedListII.java:30

↓ 3 callersMethoddeserialize

(String s)

src/main/java/L0385_MiniParser.java:49

↓ 3 callersMethoddeserialize

反序列化二叉树将字符串反序列化为二叉树

src/main/java/L0297_SerializeAndDeserializeBinaryTree.java:103

↓ 3 callersMethoddetectCycle

(ListNode head)

src/main/java/L0142_LinkedListCycleII.java:39

↓ 3 callersMethoderaseOverlapIntervals

(int[][] intervals)

src/main/java/L0435_NonOverlappingIntervals.java:25

↓ 3 callersMethodevalRPN

(String[] tokens)

src/main/java/L0150_EvaluateReversePolishNotation.java:45

↓ 3 callersMethodexist

(char[][] board, String word)

src/main/java/L0079_WordSearch.java:33

↓ 3 callersMethodfind132pattern

(int[] nums)

src/main/java/L0456_OneThreeTwoPattern.java:30

↓ 3 callersMethodfindContentChildren

(int[] g, int[] s)

src/main/java/L0455_AssignCookies.java:34

↓ 3 callersMethodfindDuplicates

(int[] nums)

src/main/java/L0442_FindAllDuplicatesInAnArray.java:24

↓ 3 callersMethodfindMaximumXOR

(int[] nums)

src/main/java/L0421_MaximumXOROfTwoNumbersInAnArray.java:19

↓ 3 callersMethodfindMedianSortedArrays

(int[] nums1, int[] nums2)

src/main/java/L0004_MedianOfTwoSortedArrays.java:10

↓ 3 callersMethodfindMin

(int[] nums)

src/main/java/L0154_FindMinimumInRotatedSortedArrayII.java:18

↓ 3 callersMethodfindMin

(int[] nums)

src/main/java/L0153_FindMinimumInRotatedSortedArray.java:40

↓ 3 callersMethodfindMinArrowShots

(int[][] points)

src/main/java/L0452_MinimumNumberOfArrowsToBurstBalloons.java:36

↓ 3 callersMethodfindMinStep

(String board, String hand)

src/main/java/L0488_ZumaGame.java:53

↓ 3 callersMethodfindOrder

(int numCourses, int[][] prerequisites)

src/main/java/L0210_CourseScheduleII.java:36

↓ 3 callersMethodfindRightInterval

(int[][] intervals)

src/main/java/L0436_FindRightInterval.java:31

↓ 3 callersMethodfindSubstringInWraproundString

(String p)

src/main/java/L0467_UniqueSubstringsInWraparoundString.java:30

↓ 3 callersMethodfirstMissingPositive

(int[] nums)

src/main/java/L0041_FirstMissingPositive.java:24

↓ 3 callersMethodfirstUniqChar

(String s)

src/main/java/L0387_FirstUniqueCharacterInString.java:8

↓ 3 callersMethodfizzBuzz

(int n)

src/main/java/L0412_FizzBuzz.java:26

↓ 3 callersMethodflatten

将二叉树展开为单链表使用前序遍历的方式，同时在遍历过程中修改树的结构

src/main/java/L0114_FlattenBinaryTreeToLinkedList.java:35

↓ 3 callersMethodfourSum

(int[] nums, int target)

src/main/java/L0018_FourSum.java:18

↓ 3 callersMethodfractionToDecimal

(int numerator, int denominator)

src/main/java/L0166_FractionToRecurringDecimal.java:34

↓ 3 callersMethodfrequencySort

(String s)

src/main/java/L0451_SortCharactersByFrequency.java:32

↓ 3 callersMethodfullJustify

(String[] words, int maxWidth)

src/main/java/L0068_TextJustification.java:55

↓ 3 callersMethodgenerate

(int numRows)

src/main/java/L0118_PascalsTriangle.java:24

↓ 3 callersMethodgenerateMatrix

(int n)

src/main/java/L0059_SpiralMatrixII.java:19

↓ 3 callersMethodgenerateParenthesis

(int n)

src/main/java/L0022_GenerateParentheses.java:11

↓ 3 callersMethodgetMaxKey

()

src/main/java/L0432_AllOne.java:119

↓ 3 callersMethodgetMinKey

()

src/main/java/L0432_AllOne.java:126

↓ 3 callersMethodgetNewsFeed

(int userId)

src/main/java/L0355_DesignTwitter.java:76

↓ 3 callersMethodgetPermutation

(int n, int k)

src/main/java/L0060_PermutationSequence.java:47

↓ 3 callersMethodgetRow

(int rowIndex)

src/main/java/L0119_PascalsTriangleII.java:29

↓ 3 callersMethodgrayCode

(int n)

src/main/java/L0089_GrayCode.java:40

↓ 3 callersMethodgroupAnagrams

(String[] strs)

src/main/java/L0049_GroupAnagrams.java:28

↓ 3 callersMethodhammingWeight

方法一：循环检查每一位使用位运算，每次检查最后一位是否为 1

src/main/java/L0191_NumberOf1Bits.java:16

↓ 3 callersMethodhammingWeight2

方法二：使用 n & (n-1) 消除最后一个 1 每次操作会消除二进制中最后一个 1，直到所有 1 被消除

src/main/java/L0191_NumberOf1Bits.java:36

↓ 3 callersMethodhasNext

()

src/main/java/L0284_PeekingIterator.java:62

↓ 3 callersMethodhasPathSum

(TreeNode root, int targetSum)

src/main/java/L0112_PathSum.java:39

↓ 3 callersMethodincreasingTriplet

查找递增的三元子序列时间复杂度：O(n)，其中 n 是数组的长度空间复杂度：O(1)，只使用了两个变量

src/main/java/L0334_IncreasingTripletSubsequence.java:37

← previous next →101–200 of 1,125, ranked by callers