MCPcopy Create free account

hub / github.com/cris1313/SwordForOffer / functions

Functions66 in github.com/cris1313/SwordForOffer

⨍ Functions 66◇ Types & classes 44
↓ 3 callersMethodpower
(double base, int exponent)
Problem16/Power.java:9
↓ 2 callersMethodConvert
(TreeNode pRootOfTree)
Problem36/ConvertSearchTree.java:9
↓ 2 callersMethodcut
(int length)
Problem14/CuttingStringDynamic.java:5
↓ 2 callersMethodgetDigitSum
(int number)
Problem13/RobotMovingRange.java:37
↓ 2 callersMethodmin
(int[] a)
Problem11/MinInRotateArray.java:8
↓ 1 callersMethodConvertSub
(TreeNode pRootOfTree)
Problem36/ConvertSearchTree.java:14
↓ 1 callersMethodMoreThanHalfNum_Solution2
采取消耗的策略。出现超过一半次数的数和其余的数消耗，最后剩下的必定为这个数 @param array @return
Problem39/MoreThanHalfNum.java:37
↓ 1 callersMethodVerifySquenceOfBST
(int[] sequence)
Problem33/VerifyBST.java:5
↓ 1 callersMethodbinary
(int n)
Problem15/NumberOf1.java:14
↓ 1 callersMethodcheck
(int threadhold, int rows, int cols, int row, int col, boolean[][] visited)
Problem13/RobotMovingRange.java:31
↓ 1 callersMethodconstructCore
(int[] pre, int[] in)
Problem7/ConstructTree.java:5
↓ 1 callersMethodcontains
(String path, char[][] matrix, int row, int col, int pathLenth, boolean[][] visited)
Problem12/PathInMatrix.java:33
↓ 1 callersMethodcount
(int[] a,int start,int middle)
Problem3/FindDuplicateNumber2.java:39
↓ 1 callersMethodcountCore
(int threadhold, int row, int col, int rows, int cols, boolean[][] visited)
Problem13/RobotMovingRange.java:18
↓ 1 callersMethodfind
不修改数组的情况下找出重复的数字 数组长度n+1,数字的范围在1~n 要求返回重复的数字
Problem3/FindDuplicateNumber2.java:10
↓ 1 callersMethodfind
二维数组中数字从左到右，从上到下递增 给定一个数字，查找二维数组返回结果
Problem4/FindNumberInTwoDArray.java:9
↓ 1 callersMethodfindSequence
输入一个正数s,输出和为s的连续正数序列 @param sum @return
Problem57/FindSequenceSum.java:40
↓ 1 callersMethodfindSequenceHelper
(int head, int tail)
Problem57/FindSequenceSum.java:66
↓ 1 callersMethodjugde
(int[] a, int start, int root)
Problem33/VerifyBST.java:10
↓ 1 callersMethodloop
(long n)
Problem10/Fibonacci.java:10
↓ 1 callersMethodminInOrder
(int[] a,int start,int end)
Problem11/MinInRotateArray.java:29
↓ 1 callersMethodmovingCount
(int thredhold, int rows, int cols)
Problem13/RobotMovingRange.java:6
↓ 1 callersMethodpreOrder
(BinaryTreeNode root)
util/BinaryTreeNode.java:10
↓ 1 callersMethodreplace
将空格替换为%20
Problem5/ReplaceSpace.java:8
↓ 1 callersMethodreverse
(long n)
Problem10/Fibonacci.java:5
↓ 1 callersMethodreversing
(ListNode root)
Problem6/ReverseListNodeRecursively.java:5
↓ 1 callersMethodshift
(int n)
Problem15/NumberOf1.java:5
↓ 1 callersMethodunsignedpower
(double base, int exponent)
Problem16/Power.java:20
MethodMoreThanHalfNum_Solution
采用栈的方式，先排序，如果数相同则进栈，否则清空栈。 @param array @return
Problem39/MoreThanHalfNum.java:19
MethodMultiThreadSingleton
多线程模式下线程安全的单例模式
Problem2/MultiThreadSingleton.java:8
MethodRandomListNode
(int label)
util/RandomListNode.java:9
MethodStaticSingleton
()
Problem2/StaticSingleton.java:9
MethodTreeNode
(int val)
util/TreeNode.java:9
MethodappendTail
(Integer a)
Problem9/QueueWithTwoStack.java:19
Methodclone
(RandomListNode pHead)
Problem35/CloneRandomList.java:8
MethodcontainPath
(String path, char[][] matrix)
Problem12/PathInMatrix.java:10
MethoddeleteHead
()
Problem9/QueueWithTwoStack.java:9
MethoddeleteNode
(ListNode head, ListNode tobeDelete)
Problem18/DeleteInO1.java:8
Methodfind
(ListNode head, int k)
Problem22/FindKthToTail.java:5
Methodfind
找出数组中重复的数字 数组长度为n,数组中的数字为0~n-1 返回重复的数字
Problem3/FindDuplicateNumber1.java:10
MethodfindNumbersWithSum
递增数列中两个数的和为s @param array @param s @return
Problem57/FindSequenceSum.java:16
MethodgetINSATCNE
()
Problem2/MultiThreadSingleton.java:10
MethodgetInstance
使用静态内部类实现的单例模式
Problem2/StaticSingleton.java:8
MethodgetNext
(PBinaryTreeNode root,PBinaryTreeNode node)
Problem8/NextNode.java:5
MethodinOrder
(PBinaryTreeNode root)
util/PBinaryTreeNode.java:18
MethodinOrder
(BinaryTreeNode root)
util/BinaryTreeNode.java:17
Methodmain
(String[] args)
Problem16/Test16.java:5
Methodmain
(String[] args)
Problem10/Test10.java:5
Methodmain
(String[] args)
Problem3/Test.java:5
Methodmain
(String[] args)
Problem5/Test5.java:5
Methodmain
(String[] args)
Problem33/VerifyBST.java:30
Methodmain
(String[] args)
Problem15/Test15.java:8
Methodmain
(String[] args)
Problem39/MoreThanHalfNum.java:9
Methodmain
(String[] args)
Problem13/Test13.java:5
Methodmain
(String[] args)
Problem4/Test4.java:5
Methodmain
(String[] args)
Problem57/FindSequenceSum.java:75
Methodmain
(String[] args)
Problem14/Test14.java:5
Methodmain
(String[] args)
Problem6/Test6.java:6
Methodmain
(String[] args)
Problem7/Test7.java:5
Methodmain
(String[] args)
Problem11/Test11.java:5
Methodmerge
(ListNode head1, ListNode head2)
Problem25/MergeList.java:5
MethodpostOrder
(PBinaryTreeNode root)
util/PBinaryTreeNode.java:25
MethodpostOrder
(BinaryTreeNode root)
util/BinaryTreeNode.java:24
MethodpreOrder
(PBinaryTreeNode root)
util/PBinaryTreeNode.java:11
Methodreverse
(ListNode head)
Problem24/ReverseList.java:5
Methodreversing
(ListNode root)
Problem6/ReverseListNode.java:8