SYMBOL INDEX (289 symbols across 55 files)

FILE: src/main/java/cn/codepub/algorithms/arrays/PrintArray.java
  class PrintArray (line 21) | public class PrintArray {
    method main (line 25) | public static void main(String[] args) {
    method moveRight (line 36) | private static void moveRight(int curRow, int curCol, int rows, int co...
    method moveDown (line 50) | private static void moveDown(int curRow, int curCol, int rows, int col...
    method moveLeft (line 64) | private static void moveLeft(int curRow, int curCol, int rows, int col...
    method moveUp (line 79) | private static void moveUp(int curRow, int curCol, int rows, int cols,...

FILE: src/main/java/cn/codepub/algorithms/commons/ConversionOfNumberSystems.java
  class ConversionOfNumberSystems (line 21) | public class ConversionOfNumberSystems {
    method conversion (line 29) | public static String conversion(int number, int base) {
    method baseString (line 65) | public static String baseString(int num, int base) {
    method test (line 75) | @Test

FILE: src/main/java/cn/codepub/algorithms/commons/MajorityNumber.java
  class MajorityNumber (line 20) | public class MajorityNumber {
    method main (line 21) | public static void main(String[] args) {
    method majorityNumber (line 30) | public int majorityNumber(ArrayList<Integer> nums) {

FILE: src/main/java/cn/codepub/algorithms/commons/MaximumProduct.java
  class MaximumProduct (line 22) | public class MaximumProduct {
    method getMaximumProduct (line 30) | public static long getMaximumProduct(long[] arrs) {
    method test (line 48) | @Test

FILE: src/main/java/cn/codepub/algorithms/commons/TopK.java
  class TopK (line 25) | public class TopK {
    method getTopK (line 36) | public static boolean getTopK(int n, int k) {
    method printTopK (line 71) | public static void printTopK(Queue queue) {
    method test (line 79) | @Test

FILE: src/main/java/cn/codepub/algorithms/graph/Dijkstra.java
  class Dijkstra (line 22) | public class Dijkstra {
    class Vertex (line 28) | class Vertex {
      method Vertex (line 32) | public Vertex(char name) {
    class Edge (line 38) | class Edge {
      method Edge (line 43) | public Edge(int value) {
    method create (line 48) | @org.junit.Test
    method getShortestPath (line 95) | public static void getShortestPath(Vertex[] vertexes) {
    method getNo (line 178) | private static int getNo(Vertex[] vertexes, char name) {

FILE: src/main/java/cn/codepub/algorithms/graph/DirectedGraphByAdjacencyList.java
  class DirectedGraphByAdjacencyList (line 22) | public class DirectedGraphByAdjacencyList {
    method main (line 23) | public static void main(String[] args) {
    method breadthFirstSearch (line 30) | private void breadthFirstSearch() {
    method depthFirstSearch (line 59) | public void depthFirstSearch() {
    method depthFirstSearch (line 69) | private void depthFirstSearch(boolean[] visited, int i) {
    class Edge (line 83) | private class Edge {
    class Vertex (line 89) | private class Vertex {
    method createGraph (line 100) | public void createGraph() {
    method getPosition (line 167) | private int getPosition(String v1) {

FILE: src/main/java/cn/codepub/algorithms/graph/DirectedGraphByAdjacencyMatrix.java
  class DirectedGraphByAdjacencyMatrix (line 23) | public class DirectedGraphByAdjacencyMatrix {
    method main (line 27) | public static void main(String[] args) {
    method breadthFirstSearch (line 34) | public void breadthFirstSearch() {
    method getNextVertex (line 68) | private int getNextVertex(int row, int col) {
    method createGraph (line 80) | public void createGraph() {
    method depthFirstSearch (line 124) | public void depthFirstSearch() {
    method depthFirstSearch (line 143) | private void depthFirstSearch(boolean[] visited, int i) {
    method getPosition (line 162) | public int getPosition(String s) {

FILE: src/main/java/cn/codepub/algorithms/graph/FloydWarshall.java
  class FloydWarshall (line 21) | public class FloydWarshall {
    class Vertex (line 27) | class Vertex {
      method Vertex (line 31) | public Vertex(char name) {
    class Edge (line 37) | class Edge {
      method Edge (line 42) | public Edge(int value) {
    method create (line 47) | @org.junit.Test
    method getShortestPathByDp (line 86) | public static void getShortestPathByDp(Vertex[] vertexes) {
    method getNo (line 134) | private static int getNo(Vertex[] vertexes, char name) {
    method constructShortestPath (line 150) | public static String constructShortestPath(int start, int end) {

FILE: src/main/java/cn/codepub/algorithms/graph/Kruskal.java
  class Kruskal (line 27) | public class Kruskal {
    class Vertex (line 43) | private static class Vertex {
      method Vertex (line 46) | public Vertex(char name) {
      method toString (line 50) | @Override
    class Edge (line 56) | private static class Edge {
      method Edge (line 61) | public Edge(Vertex a, Vertex b, int val) {
      method toString (line 67) | @Override
    method addEdge (line 80) | public static void addEdge(Vertex a, Vertex b, int val) {
    method minimumSpanningTree (line 85) | public static void minimumSpanningTree() {
    method getVertexNo (line 105) | private static int getVertexNo(List<Vertex> vertexList, char name) {
    method create (line 114) | @Test

FILE: src/main/java/cn/codepub/algorithms/graph/Prim.java
  class Prim (line 23) | public class Prim {
    class Vertex (line 24) | private static class Vertex {
      method Vertex (line 27) | public Vertex(char name) {
      method Vertex (line 31) | public Vertex() {
      method toString (line 35) | @Override
    class Edge (line 41) | private static class Edge {
      method Edge (line 46) | public Edge(Vertex start, Vertex end, int value) {
    method addEdge (line 57) | public static void addEdge(Vertex a, Vertex b, int val) {
    method minimumSpanningTree (line 66) | public static void minimumSpanningTree() {
    method containVertex (line 97) | private static boolean containVertex(char name) {
    method create (line 106) | @Test

FILE: src/main/java/cn/codepub/algorithms/graph/UndirectedGraphByAdjacencyList.java
  class UndirectedGraphByAdjacencyList (line 22) | public class UndirectedGraphByAdjacencyList {
    method main (line 23) | public static void main(String[] args) {
    method breadthFirstSearch (line 48) | private void breadthFirstSearch() {
    method depthFirstSearch (line 77) | public void depthFirstSearch() {
    method depthFirstSearch (line 87) | private void depthFirstSearch(boolean[] visited, int i) {
    class Edge (line 101) | private class Edge {
    class Vertex (line 107) | private class Vertex {
    method createGraph (line 118) | public void createGraph() {
    method getPosition (line 201) | private int getPosition(String v1) {

FILE: src/main/java/cn/codepub/algorithms/graph/UndirectedGraphByAdjacencyMatrix.java
  class UndirectedGraphByAdjacencyMatrix (line 24) | public class UndirectedGraphByAdjacencyMatrix {
    method main (line 28) | public static void main(String[] args) {
    method breadthFirstSearch (line 45) | public void breadthFirstSearch() {
    method createGraph (line 75) | public void createGraph() {
    method depthFirstSearch (line 120) | public void depthFirstSearch() {
    method depthFirstSearch (line 139) | private void depthFirstSearch(boolean[] visited, int i) {
    method getNextVertex (line 159) | private int getNextVertex(int row, int col) {
    method getPosition (line 174) | public int getPosition(String s) {

FILE: src/main/java/cn/codepub/algorithms/graph/utils/UnionFindSet.java
  class UnionFindSet (line 18) | public class UnionFindSet {
    method UnionFindSet (line 23) | public UnionFindSet() {
    method UnionFindSet (line 27) | public UnionFindSet(int size) {
    method init (line 35) | private void init() {
    method makeSet (line 44) | public void makeSet() {
    method findSet (line 57) | public int findSet(int x) {
    method union (line 71) | public void union(int x, int y) {

FILE: src/main/java/cn/codepub/algorithms/matrix/Matrix.java
  class Matrix (line 18) | public class Matrix {
    method main (line 23) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/algorithms/multithread/ThreadSynchronization.java
  class ThreadSynchronization (line 20) | public class ThreadSynchronization extends Thread {
    method ThreadSynchronization (line 28) | public ThreadSynchronization(AtomicInteger synObj, String name, int fl...
    method run (line 34) | @Override
    method main (line 57) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/algorithms/queue/PriorityApp.java
  class PriorityApp (line 20) | public class PriorityApp {
    method main (line 21) | public static void main(String[] args) {
    class PriorityQ (line 34) | class PriorityQ {
      method PriorityQ (line 39) | public PriorityQ(int s) {
      method insert (line 45) | public void insert(long item) {
      method remove (line 64) | public long remove() {
      method peekMin (line 68) | public long peekMin() {
      method isEmpty (line 72) | public boolean isEmpty() {
      method isFull (line 76) | public boolean isFull() {

FILE: src/main/java/cn/codepub/algorithms/similarity/cilin/WordSimilarity.java
  class WordSimilarity (line 34) | @Log4j2
    method readCiLin (line 70) | private static void readCiLin() {
    method getSimilarity (line 119) | public static double getSimilarity(String word1, String word2) {
    method isIndependent (line 189) | private boolean isIndependent(String source) {
    method getEncode (line 212) | protected static ArrayList<String> getEncode(String word) {
    method getN (line 223) | protected static int getN(String encodeHead) {
    method getCount (line 239) | protected static int getCount(String encodeHead, int end) {
    method getK (line 261) | protected static int getK(String encode1, String encode2) {
    method getCommonStr (line 298) | protected static String getCommonStr(String encode1, String encode2) {
    method testGetN (line 318) | @Test
    method testGetK (line 325) | @Test
    method testGetCommonStr (line 331) | @Test
    method testGetSimilarity (line 337) | @Test
    method testGetSimilarity2 (line 362) | @Test

FILE: src/main/java/cn/codepub/algorithms/sorting/BubbleSort.java
  class BubbleSort (line 22) | public class BubbleSort {
    method bubbleSort (line 23) | public void bubbleSort(int[] nums) {
    method swap (line 33) | public void swap(int[] nums, int one, int two) {
    method test (line 39) | @Test

FILE: src/main/java/cn/codepub/algorithms/sorting/InsertSort.java
  class InsertSort (line 20) | public class InsertSort {
    method main (line 21) | public static void main(String[] args) {
    method swap (line 35) | private static void swap(int[] nums, int first, int second) {

FILE: src/main/java/cn/codepub/algorithms/sorting/QuickSort.java
  class QuickSort (line 20) | public class QuickSort {
    method main (line 21) | public static void main(String[] args) {
    method quickSort (line 27) | public void quickSort(int nums[], int start, int end) {
    method swap (line 54) | private void swap(int nums[], int left, int right) {

FILE: src/main/java/cn/codepub/algorithms/sorting/SelectionSort.java
  class SelectionSort (line 22) | public class SelectionSort {
    method selectionSort (line 23) | public void selectionSort(int[] nums) {
    method swap (line 36) | public void swap(int[] nums, int one, int two) {
    method test (line 42) | @Test

FILE: src/main/java/cn/codepub/algorithms/sorting/ShellSort.java
  class ShellSort (line 20) | public class ShellSort {
    method main (line 21) | public static void main(String[] args) {
    method swap (line 43) | private static void swap(int[] nums, int first, int second) {

FILE: src/main/java/cn/codepub/algorithms/spelling/ChineseToSpelling.java
  class ChineseToSpelling (line 21) | public class ChineseToSpelling {
    method convertChineseToSpelling (line 25) | public static String convertChineseToSpelling(String chinese, Spelling...
  type SpellingFormat (line 47) | enum SpellingFormat {

FILE: src/main/java/cn/codepub/algorithms/stack/BracketsApp.java
  class BracketsApp (line 25) | public class BracketsApp {
    method main (line 26) | public static void main(String[] args) throws IOException {
    method getString (line 40) | public static String getString() throws IOException {
  class BracketChecker (line 48) | class BracketChecker {
    method BracketChecker (line 51) | public BracketChecker(String in) {
    method check (line 55) | public void check() {

FILE: src/main/java/cn/codepub/algorithms/stack/CheckStackSequence.java
  class CheckStackSequence (line 29) | public class CheckStackSequence {
    method main (line 30) | public static void main(String[] args) {
    method check (line 56) | public static boolean check(int[] nums1, int[] nums2) {

FILE: src/main/java/cn/codepub/algorithms/stack/InfixApp.java
  class InfixApp (line 27) | public class InfixApp {
    method main (line 28) | public static void main(String[] args) throws IOException {
    method getString (line 44) | public static String getString() throws IOException {
  class InToPost (line 54) | class InToPost {
    method InToPost (line 59) | public InToPost(String in) {
    method doTrans (line 65) | public String doTrans() {
    method gotOper (line 97) | public void gotOper(char opThis, int prec1) {
    method gotParen (line 121) | public void gotParen(char ch) {

FILE: src/main/java/cn/codepub/algorithms/stack/MinStack.java
  class MinStack (line 21) | public class MinStack {
    method main (line 22) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/algorithms/stack/PostfixApp.java
  class PostfixApp (line 31) | public class PostfixApp {
    method main (line 32) | public static void main(String[] args) throws Exception {
    method getString (line 48) | public static String getString() throws Exception {
  class ParsePost (line 57) | class ParsePost {
    method ParsePost (line 61) | public ParsePost(String s) {
    method doParse (line 65) | public int doParse() {

FILE: src/main/java/cn/codepub/algorithms/strings/BinarySearch.java
  class BinarySearch (line 19) | public class BinarySearch {
    method recursionBinarySearch (line 30) | private static int recursionBinarySearch(int[] nums, int start, int en...
    method nonRecursionBinarySearch (line 55) | private static int nonRecursionBinarySearch(int[] nums, int key) {
    method main (line 73) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/algorithms/strings/Combination.java
  class Combination (line 18) | public class Combination {
    method main (line 22) | public static void main(String[] args) {
    method combination (line 39) | public static void combination(char[] strs, int start, int number) {
    method combination (line 63) | public static void combination() {

FILE: src/main/java/cn/codepub/algorithms/strings/JaccardSimilarityCoefficient.java
  class JaccardSimilarityCoefficient (line 26) | public class JaccardSimilarityCoefficient {
    method getJSC (line 27) | public double getJSC(String str1, String str2) {
    method calcBySets (line 57) | public static double calcBySets(String s0, String s1) {

FILE: src/main/java/cn/codepub/algorithms/strings/LCS.java
  class LCS (line 20) | public class LCS {
    method lcsBase (line 21) | public static String lcsBase(String inputX, String inputY) {
    method getMax (line 36) | private static String getMax(String x, String y) {
    method test (line 57) | @Test

FILE: src/main/java/cn/codepub/algorithms/strings/LCS2.java
  class LCS2 (line 20) | public class LCS2 {
    method getComLen (line 21) | private static Integer getComLen(String firstStr, String secondStr) {
    method lcsBase (line 35) | private static String lcsBase(String inputX, String inputY) {
    method test (line 51) | @Test

FILE: src/main/java/cn/codepub/algorithms/strings/LCS3.java
  class LCS3 (line 20) | public class LCS3 {
    method lcsDp (line 21) | public static String lcsDp(String inputX, String inputY) {
    method test (line 59) | @Test

FILE: src/main/java/cn/codepub/algorithms/strings/LevenshteinDistance.java
  class LevenshteinDistance (line 20) | public class LevenshteinDistance {
    method leDistance (line 21) | public static int leDistance(String inputX, String inputY) {
    method test (line 44) | @Test

FILE: src/main/java/cn/codepub/algorithms/strings/LongestDecreasingSubSequence.java
  class LongestDecreasingSubSequence (line 14) | public class LongestDecreasingSubSequence {
    method main (line 15) | public static void main(String[] args) {
    method getLongestDecreaseSubSequence (line 29) | public List<Integer> getLongestDecreaseSubSequence(int[] nums) {
    method getLongestIncreaseSubSequence (line 69) | public List<Integer> getLongestIncreaseSubSequence(int[] nums) {

FILE: src/main/java/cn/codepub/algorithms/strings/Manacher.java
  class Manacher (line 26) | public class Manacher {
    method main (line 27) | public static void main(String[] args) {
    method getMaxPalindrome (line 38) | private int getMaxPalindrome(String str) {

FILE: src/main/java/cn/codepub/algorithms/strings/PatternStringMatch.java
  class PatternStringMatch (line 18) | public class PatternStringMatch {
    method main (line 19) | public static void main(String[] args) {
    method search (line 32) | private static int search(String text, String pat) {

FILE: src/main/java/cn/codepub/algorithms/strings/Permutation.java
  class Permutation (line 39) | public class Permutation {
    method main (line 42) | public static void main(String[] args) {
    method permutation (line 47) | public static void permutation(char[] strs, int start, int end) {
    method swap (line 61) | private static void swap(char[] chars, int first, int second) {

FILE: src/main/java/cn/codepub/algorithms/strings/ReverseString.java
  class ReverseString (line 23) | public class ReverseString {
    method ReverseString (line 27) | public ReverseString(String in) {
    method doRev (line 31) | public String doRev() {
    method getString (line 45) | public static String getString() throws Exception {
    method main (line 52) | public static void main(String[] args) throws Exception {

FILE: src/main/java/cn/codepub/algorithms/strings/StringSort.java
  class StringSort (line 21) | public class StringSort {
    method main (line 23) | public static void main(String[] args) {
    method bubbleSort (line 34) | public static void bubbleSort(String[] strs) {
    method compare (line 55) | private static int compare(String s1, String s2) {

FILE: src/main/java/cn/codepub/algorithms/trees/DepthFirstTraversal.java
  class DepthFirstTraversal (line 22) | public class DepthFirstTraversal {
    method main (line 25) | public static void main(String[] args) {
    method dfs (line 46) | public static void dfs(Tree root) {

FILE: src/main/java/cn/codepub/algorithms/trees/GetPathsBySum.java
  class GetPathsBySum (line 26) | public class GetPathsBySum {
    method main (line 30) | public static void main(String[] args) {
    method dfs (line 60) | public static void dfs(Tree root, List<Tree> path) {

FILE: src/main/java/cn/codepub/algorithms/trees/LevelTraverseBinaryTree.java
  class LevelTraverseBinaryTree (line 24) | public class LevelTraverseBinaryTree {
    method main (line 25) | public static void main(String[] args) {
    method levelTraverse (line 43) | public static void levelTraverse(Tree root, Queue<Tree> queue) {

FILE: src/main/java/cn/codepub/algorithms/trees/TraverseBinaryTree.java
  class TraverseBinaryTree (line 20) | public class TraverseBinaryTree {
    method main (line 21) | public static void main(String[] args) {
    method preOrder (line 43) | public static void preOrder(Tree root) {
    method inOrder (line 56) | public static void inOrder(Tree root) {
    method postOrder (line 69) | public static void postOrder(Tree root) {

FILE: src/main/java/cn/codepub/algorithms/trees/VerifySequenceOfBST.java
  class VerifySequenceOfBST (line 22) | public class VerifySequenceOfBST {
    method main (line 23) | public static void main(String[] args) {
    method verify (line 32) | public static boolean verify(int[] sequences) {

FILE: src/main/java/cn/codepub/algorithms/utils/StackX.java
  class StackX (line 18) | public class StackX<T> {
    method StackX (line 23) | public StackX() {
    method StackX (line 27) | public StackX(int s) {
    method push (line 33) | public void push(T j) {
    method pop (line 37) | public T pop() {
    method peek (line 41) | public T peek() {
    method isEmpty (line 45) | public boolean isEmpty() {
    method size (line 49) | public int size() {
    method peekN (line 53) | public T peekN(int n) {
    method displayStack (line 57) | public void displayStack(String s) {

FILE: src/main/java/cn/codepub/algorithms/utils/Tree.java
  class Tree (line 18) | public class Tree {
    method Tree (line 24) | public Tree() {
    method Tree (line 28) | public Tree(int value) {
    method toString (line 32) | @Override

FILE: src/main/java/cn/codepub/patterns/core/DeepClone.java
  class DeepClone (line 21) | public class DeepClone {
    method main (line 22) | public static void main(String[] args) {
  class MyPerson (line 42) | class MyPerson implements Cloneable, Serializable {
    method MyPerson (line 47) | public MyPerson(String name, int age) {
    method MyPerson (line 52) | public MyPerson(String name, int age, MyPerson son) {
    method deepClone (line 57) | public Object deepClone() throws IOException, ClassNotFoundException {
    method clone (line 68) | @Override

FILE: src/main/java/cn/codepub/patterns/core/Singleton.java
  class Singleton (line 21) | public class Singleton {
    method Singleton (line 22) | private Singleton() {
    method getInstance (line 28) | public static Singleton getInstance() {
    method main (line 39) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/patterns/proxy/CGLibProxyHandler.java
  class CGLibProxyHandler (line 26) | public class CGLibProxyHandler implements MethodInterceptor {
    method getInstance (line 34) | public Object getInstance(Object tar) {
    method intercept (line 55) | @Override
    method testCGLibProxy (line 64) | @org.junit.Test

FILE: src/main/java/cn/codepub/patterns/proxy/CountImpl.java
  type Count (line 6) | interface Count {
    method queryCount (line 8) | void queryCount();
    method updateCount (line 11) | void updateCount();
  class CountImpl (line 14) | public class CountImpl implements Count {
    method queryCount (line 15) | @Override
    method updateCount (line 20) | @Override

FILE: src/main/java/cn/codepub/patterns/proxy/JDKProxyHandler.java
  class JDKProxyHandler (line 26) | public class JDKProxyHandler implements InvocationHandler {
    method JDKProxyHandler (line 29) | public JDKProxyHandler() {
    method JDKProxyHandler (line 33) | public JDKProxyHandler(Object tar) {
    method bind (line 37) | public Object bind(Object tar) {
    method invoke (line 42) | @Override
    method testDynamicProxy (line 52) | public static void testDynamicProxy() {
    method main (line 59) | public static void main(String[] args) {

FILE: src/main/java/cn/codepub/patterns/proxy/StaticProxyHandler.java
  class StaticProxyHandler (line 18) | public class StaticProxyHandler implements Count {
    method StaticProxyHandler (line 22) | public StaticProxyHandler() {
    method StaticProxyHandler (line 27) | public StaticProxyHandler(Count count) {
    method queryCount (line 31) | @Override
    method updateCount (line 39) | @Override
    method main (line 47) | public static void main(String[] args) {
    method testStaticProxy (line 51) | public static void testStaticProxy() {