SYMBOL INDEX (651 symbols across 155 files)

FILE: algorithms/src/array/BinarySearch.java
  class BinarySearch (line 3) | public class BinarySearch {
    method binarySearch (line 6) | public static int binarySearch(int[] array, int target) {
    method binarySearchRecur (line 28) | public static int binarySearchRecur(int[] array, int target) {
    method bs (line 33) | private static int bs(int[] array, int target, int lo, int hi) {
    method bsFirst (line 50) | public static int bsFirst(int[] array, int target) {
    method bsLast (line 74) | public static int bsLast(int[] array, int target) {
    method bsFistGE (line 98) | public static int bsFistGE(int[] array, int target) {
    method bsLastLE (line 120) | public static int bsLastLE(int[] array, int target) {

FILE: algorithms/src/array/BinarySearchTest.java
  class BinarySearchTest (line 6) | public class BinarySearchTest {
    method testBinarySearch (line 9) | @Test
    method testBinarySearchRecur (line 35) | @Test
    method testBsFirst (line 62) | @Test
    method testBsLast (line 79) | @Test
    method testBsFirstGE (line 96) | @Test
    method testBsLastLE (line 113) | @Test

FILE: algorithms/src/array/GenericArray.java
  class GenericArray (line 10) | public class GenericArray<T> {
    method GenericArray (line 15) | public GenericArray(int capacity) {
    method GenericArray (line 21) | public GenericArray() {
    method getCapacity (line 26) | public int getCapacity() {
    method getSize (line 31) | public int getSize() {
    method isEmpty (line 36) | public boolean isEmpty() {
    method set (line 41) | public void set(int index, T e) {
    method get (line 47) | public T get(int index) {
    method contains (line 53) | public boolean contains(T e) {
    method find (line 65) | public int find(T e) {
    method add (line 76) | public void add(int index, T e) {
    method addFirst (line 89) | public void addFirst(T e) {
    method addLast (line 94) | public void addLast(T e) {
    method remove (line 99) | public T remove(int index) {
    method removeFirst (line 116) | public T removeFirst() {
    method removeLast (line 121) | public T removeLast() {
    method removeElement (line 126) | public void removeElement(T e) {
    method toString (line 133) | @Override
    method resize (line 150) | private void resize(int capacity) {
    method checkIndex (line 158) | private void checkIndex(int index) {
    method checkIndexForRemove (line 164) | private void checkIndexForRemove(int index) {

FILE: algorithms/src/array/MinNumberInRotatedArray.java
  class MinNumberInRotatedArray (line 3) | public class MinNumberInRotatedArray {
    method getMinNumber (line 5) | public static int getMinNumber(int[] arr) {
    method getMinInOrder (line 37) | private static int getMinInOrder(int[] arr, int l, int r) {

FILE: algorithms/src/array/MinNumberInRotatedArrayTest.java
  class MinNumberInRotatedArrayTest (line 6) | public class MinNumberInRotatedArrayTest {
    method testGetMinNumber (line 8) | @Test

FILE: algorithms/src/joseph/Joseph.java
  class Joseph (line 18) | public class Joseph {
    method lastRemain (line 19) | public int lastRemain(int n, int m) {
    method lastRemainIter (line 31) | public int lastRemainIter(int n, int m) {

FILE: algorithms/src/linkedlist/FindMidNode.java
  class FindMidNode (line 3) | public class FindMidNode {
    method findMidNode (line 6) | public static Node findMidNode(Node head) {
    method findMidNodeFast (line 29) | public static Node findMidNodeFast(Node head) {
    method createNode (line 46) | public static Node createNode(int value) {
    class Node (line 50) | public static class Node {
      method Node (line 54) | public Node(int data, Node next) {

FILE: algorithms/src/linkedlist/FindMidNodeTest.java
  class FindMidNodeTest (line 7) | public class FindMidNodeTest {
    method testFindMidNode (line 9) | @Test
    method testFindMidNodeFast (line 26) | @Test

FILE: algorithms/src/linkedlist/SingleLinkedList.java
  class SingleLinkedList (line 3) | public class SingleLinkedList {
    method findByValue (line 8) | public Node findByValue(int value) {
    method findByIndex (line 20) | public Node findByIndex(int index) {
    method insertToHead (line 35) | public void insertToHead(int value) {
    method insertToHead (line 40) | public void insertToHead(Node newNode) {
    method insertToTail (line 49) | public void insertToTail(int value) {
    method insertToTail (line 54) | public void insertToTail(Node newNode) {
    method insertAfter (line 73) | public void insertAfter(Node p, int value) {
    method insertAfter (line 78) | public void insertAfter(Node p, Node newNode) {
    method insertBefore (line 87) | public void insertBefore(Node p, int value) {
    method insertBefore (line 92) | public void insertBefore(Node p, Node newNode) {
    method deleteByNode (line 116) | public void deleteByNode(Node p) {
    method deleteByValue (line 138) | public void deleteByValue(int value) {
    method printAll (line 154) | public void printAll() {
    method createNode (line 167) | public static Node createNode(int value) {
    class Node (line 171) | public static class Node {
      method Node (line 175) | public Node(int data, Node next) {
      method getData (line 180) | public int getData() {

FILE: algorithms/src/linkedlist/SingleLinkedListTest.java
  class SingleLinkedListTest (line 5) | public class SingleLinkedListTest {
    method testSingleLinkedList (line 7) | @Test

FILE: algorithms/src/lru/LRU.java
  class LRU (line 30) | public class LRU<K,V> implements Iterable<K> {
    class Node (line 38) | private class Node {
      method Node (line 44) | public Node(K k, V v) {
    method LRU (line 50) | public LRU(int maxSize) {
    method get (line 62) | public V get(K key) {
    method put (line 75) | public void put(K key, V value) {
    method removeTail (line 91) | private Node removeTail() {
    method appendToHead (line 104) | private void appendToHead(Node node) {
    method unlink (line 113) | private void unlink(Node node) {
    method iterator (line 124) | @Override
    class LRUIterator (line 129) | private class LRUIterator<K> implements Iterator<K> {
      method hasNext (line 132) | @Override
      method next (line 137) | @Override

FILE: algorithms/src/lru/LRUTest.java
  class LRUTest (line 6) | public class LRUTest {
    method testLRU (line 7) | @Test

FILE: algorithms/src/queue/ArrayQueue.java
  class ArrayQueue (line 3) | public class ArrayQueue<T> implements Queue<T> {
    method ArrayQueue (line 9) | public ArrayQueue(int capacity) {
    method enqueue (line 17) | @Override
    method dequeue (line 42) | @Override
    method printAll (line 55) | public void printAll() {
    method main (line 64) | public static void main(String[] args) {

FILE: algorithms/src/queue/CircularQueue.java
  class CircularQueue (line 3) | public class CircularQueue<T> {
    method CircularQueue (line 9) | public CircularQueue(int capacity) {
    method enqueue (line 17) | public boolean enqueue(T item) {
    method dequeue (line 29) | public T dequeue() {
    method printAll (line 43) | public void printAll() {
    method main (line 52) | public static void main(String[] args) {

FILE: algorithms/src/queue/ListQueue.java
  class ListQueue (line 3) | public class ListQueue<T> implements Queue<T> {
    method enqueue (line 9) | @Override
    method dequeue (line 25) | @Override
    method printAll (line 39) | public void printAll() {
    class Node (line 48) | private static class Node<T>{
      method Node (line 52) | public Node(T data, Node next) {
      method getData (line 57) | public T getData() {
    method main (line 62) | public static void main(String[] args) {

FILE: algorithms/src/queue/Queue.java
  type Queue (line 3) | public interface Queue<T> {
    method enqueue (line 4) | boolean enqueue(T item);
    method dequeue (line 5) | T dequeue();

FILE: algorithms/src/stack/ArrayStack.java
  class ArrayStack (line 3) | public class ArrayStack<T> implements Stack<T> {
    method ArrayStack (line 9) | public ArrayStack(int capacity) {
    method push (line 16) | @Override
    method pop (line 31) | @Override
    method peek (line 45) | @Override
    method main (line 53) | public static void main(String[] args) {

FILE: algorithms/src/stack/DynamicArrayStack.java
  class DynamicArrayStack (line 8) | public class DynamicArrayStack<T> implements Stack<T> {
    method DynamicArrayStack (line 13) | public DynamicArrayStack(int capacity) {
    method push (line 21) | @Override
    method pop (line 35) | @Override
    method peek (line 48) | @Override
    method resize (line 56) | private void resize(int size) {
    method main (line 65) | public static void main(String[] args) {

FILE: algorithms/src/stack/ListStack.java
  class ListStack (line 3) | public class ListStack<T> implements Stack<T> {
    method push (line 7) | @Override
    method pop (line 22) | @Override
    method peek (line 37) | @Override
    class Node (line 45) | public static class Node<T> {
      method Node (line 49) | public Node(T data, Node next) {
      method getData (line 54) | public T getData() {
    method main (line 59) | public static void main(String[] args) {

FILE: algorithms/src/stack/SampleBrowser.java
  class SampleBrowser (line 6) | public class SampleBrowser {

FILE: algorithms/src/stack/Stack.java
  type Stack (line 3) | public interface Stack<T> {
    method push (line 4) | boolean push(T item);
    method pop (line 5) | T pop();
    method peek (line 6) | T peek();

FILE: leetcode/src/linkedlistcycle_141/LinkedListCycle.java
  class LinkedListCycle (line 7) | public class LinkedListCycle {
    method hasCycle (line 8) | public boolean hasCycle(ListNode head) {
    class ListNode (line 25) | public static class ListNode {
      method ListNode (line 28) | ListNode(int x) { val = x;}

FILE: leetcode/src/lrucache_146/LRUCache.java
  class LRUCache (line 10) | public class LRUCache {
    method LRUCache (line 16) | public LRUCache(int capacity) {
    method get (line 27) | public int get(int key) {
    method put (line 41) | public void put(int key, int value) {
    method delete (line 58) | private void delete(Node node) {
    method insertToHead (line 69) | private void insertToHead(Node node) {
    method deleteTail (line 78) | private Node deleteTail() {
    class Node (line 91) | private class Node {
      method Node (line 97) | public Node (int key, int value) {

FILE: leetcode/src/mergetwosortedlist_21/Merge2SortedLists.java
  class Merge2SortedLists (line 7) | public class Merge2SortedLists {
    method mergeTwoLists (line 8) | public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    method mergeTwoListsRecur (line 39) | public ListNode mergeTwoListsRecur(ListNode l1, ListNode l2) {
    class ListNode (line 51) | public static class ListNode {
      method ListNode (line 54) | ListNode(int x) { val = x;}

FILE: leetcode/src/middleofthelinkedlist_876/MiddleNode.java
  class MiddleNode (line 7) | public class MiddleNode {
    method middleNode (line 8) | public ListNode middleNode(ListNode head) {
    class ListNode (line 21) | public static class ListNode {
      method ListNode (line 24) | ListNode(int x) { val = x;}

FILE: leetcode/src/palindromelinkedlist_234/PalindromeLinkedList.java
  class PalindromeLinkedList (line 14) | public class PalindromeLinkedList {
    method isPalindrome (line 15) | public boolean isPalindrome(ListNode head) {
    class ListNode (line 55) | public static class ListNode {
      method ListNode (line 58) | ListNode(int x) {

FILE: leetcode/src/removenthnodefromendoflist_19/RemoveNthNodeFromEndOfList.java
  class RemoveNthNodeFromEndOfList (line 7) | public class RemoveNthNodeFromEndOfList {
    method removeNthFromEnd (line 8) | public ListNode removeNthFromEnd(ListNode head, int n) {
    class ListNode (line 34) | public static class ListNode {
      method ListNode (line 37) | ListNode(int x) {

FILE: leetcode/src/reverselinkedlist_206/ReverseList.java
  class ReverseList (line 7) | public class ReverseList {
    method reverseList (line 8) | public ListNode reverseList(ListNode head) {
    class ListNode (line 24) | public static class ListNode {
      method ListNode (line 27) | ListNode(int x) {

FILE: leetcode/src/threesum_015/ThreeSum.java
  class ThreeSum (line 3) | public class ThreeSum {

FILE: leetcode/src/twosum_001/TwoSum.java
  class TwoSum (line 3) | public class TwoSum {
    method main (line 4) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_03_FindDuplicatedNumInArray.java
  class Ex_03_FindDuplicatedNumInArray (line 12) | public class Ex_03_FindDuplicatedNumInArray {
    method duplicate (line 14) | public boolean duplicate(int numbers[], int [] duplication) {
    method duplicateImprove (line 45) | public boolean duplicateImprove(int numbers[], int [] duplication) {
    method swap (line 66) | private static void swap(int[] arr, int i, int j) {

FILE: offer/src/com/ex/offer/Ex_03_FindDuplicatedNumInWithoutChangeArray.java
  class Ex_03_FindDuplicatedNumInWithoutChangeArray (line 8) | public class Ex_03_FindDuplicatedNumInWithoutChangeArray {
    method duplicate (line 10) | public static int duplicate(int numbers[]) {
    method countRange (line 40) | private static int countRange(int[] numbers, int start, int end) {
    method main (line 55) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_04_FindNumIn2VArray.java
  class Ex_04_FindNumIn2VArray (line 8) | public class Ex_04_FindNumIn2VArray {
    method Find (line 10) | public static boolean Find(int target, int[][] array) {
    method main (line 31) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_05_ReplaceSpace.java
  class Ex_05_ReplaceSpace (line 7) | public class Ex_05_ReplaceSpace {
    method replaceSpace (line 8) | public static String replaceSpace(StringBuffer str) {
    method replaceBlank (line 23) | public static String replaceBlank(StringBuffer str) {
    method main (line 56) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_06_PrintListFromTailToHead.java
  class Ex_06_PrintListFromTailToHead (line 8) | public class Ex_06_PrintListFromTailToHead {
    method printListFromTailToHead (line 10) | public static ArrayList<Integer> printListFromTailToHead(ListNode list...
    method printListFromTailToHeadRecur (line 28) | public static ArrayList<Integer> printListFromTailToHeadRecur(ListNode...
    method printListFromTailToHeadWithCollections (line 47) | public static ArrayList<Integer> printListFromTailToHeadWithCollection...
    method main (line 58) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_07_ReConstructBT.java
  class Ex_07_ReConstructBT (line 14) | public class Ex_07_ReConstructBT {
    method reConstructBinaryTree (line 16) | public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
    method reConstructBinaryTree (line 24) | private static TreeNode reConstructBinaryTree(int[] pre, int preStart,...

FILE: offer/src/com/ex/offer/Ex_08_DescendantNode.java
  class Ex_08_DescendantNode (line 3) | public class Ex_08_DescendantNode {
    class Node (line 5) | public static class Node {
      method Node (line 11) | public Node(int data) {
    method getNextNode (line 16) | public static Node getNextNode(Node node) {
    method getLeftMost (line 32) | public static Node getLeftMost(Node node) {
    method main (line 42) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_08_GetNextNodeInBT.java
  class Ex_08_GetNextNodeInBT (line 7) | public class Ex_08_GetNextNodeInBT {
    method GetNext (line 8) | public TreeLinkNode GetNext(TreeLinkNode pNode) {
    method getMostLeft (line 25) | private TreeLinkNode getMostLeft(TreeLinkNode node) {

FILE: offer/src/com/ex/offer/Ex_09_QueueWithTwoStack.java
  class Ex_09_QueueWithTwoStack (line 9) | public class Ex_09_QueueWithTwoStack {
    method push (line 13) | public void push(int node) {
    method pop (line 17) | public int pop() {

FILE: offer/src/com/ex/offer/Ex_09_StackWithTwoQueue.java
  class Ex_09_StackWithTwoQueue (line 6) | public class Ex_09_StackWithTwoQueue {
    method push (line 11) | public void push(int node) {
    method pop (line 15) | public int pop() {
    method main (line 33) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_10_Fibonacci.java
  class Ex_10_Fibonacci (line 3) | public class Ex_10_Fibonacci {
    method fib1 (line 5) | public static int fib1(int n) {
    method fib2 (line 22) | public static int fib2(int n) {
    method Fibonacci (line 26) | public static int Fibonacci(int n) {
    method main (line 49) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_10_JumpFloor.java
  class Ex_10_JumpFloor (line 3) | public class Ex_10_JumpFloor {
    method jumpFloor (line 5) | public int jumpFloor(int target) {
    method JumpFloor (line 13) | public int JumpFloor(int target) {

FILE: offer/src/com/ex/offer/Ex_10_JumpFloorII.java
  class Ex_10_JumpFloorII (line 20) | public class Ex_10_JumpFloorII {
    method JumpFloorII (line 22) | public static int JumpFloorII(int target) {

FILE: offer/src/com/ex/offer/Ex_10_RectCover.java
  class Ex_10_RectCover (line 3) | public class Ex_10_RectCover {
    method RectCover (line 4) | public int RectCover(int target) {

FILE: offer/src/com/ex/offer/Ex_11_MinNumOfRotatingArray.java
  class Ex_11_MinNumOfRotatingArray (line 9) | public class Ex_11_MinNumOfRotatingArray {
    method minNumberInRotateArray (line 11) | public static int minNumberInRotateArray(int [] array) {
    method minInOrder (line 45) | private static int minInOrder(int[] array, int low, int high) {
    method main (line 55) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_11_SortAges.java
  class Ex_11_SortAges (line 3) | public class Ex_11_SortAges {
    method sortAges (line 6) | public static void sortAges(int[] ages) {
    method printArray (line 28) | public static void printArray(int[] arr) {
    method main (line 35) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_12_HasPathInMatrix.java
  class Ex_12_HasPathInMatrix (line 3) | public class Ex_12_HasPathInMatrix {
    method hasPath (line 5) | public static boolean hasPath(char[] matrix, int rows, int cols, char[...
    method hasPathCore (line 25) | public static boolean hasPathCore(char[] matrix, int rows, int cols, c...
    method main (line 52) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_13_MovingCount.java
  class Ex_13_MovingCount (line 3) | public class Ex_13_MovingCount {
    method movingCount (line 5) | public int movingCount(int threshold, int rows, int cols) {
    method helper (line 17) | public int helper(int threshold, int rows, int cols, int row, int col,...
    method check (line 32) | public boolean check(int threshold, int rows, int cols, int row, int c...
    method getDigitSum (line 42) | public int getDigitSum(int x) {

FILE: offer/src/com/ex/offer/Ex_14_MaxProductionAfterCutting.java
  class Ex_14_MaxProductionAfterCutting (line 3) | public class Ex_14_MaxProductionAfterCutting {
    method maxProduction (line 5) | public static int maxProduction(int n) {
    method maxProductionWithGreedy (line 40) | public static int maxProductionWithGreedy(int n) {
    method main (line 64) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_15_Count1.java
  class Ex_15_Count1 (line 3) | public class Ex_15_Count1 {
    method NumberOf1 (line 5) | public static int NumberOf1(int n) {
    method NumberOf1Optimal (line 19) | public static int NumberOf1Optimal(int n) {
    method main (line 30) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_15_CountDifferInMN.java
  class Ex_15_CountDifferInMN (line 3) | public class Ex_15_CountDifferInMN {
    method countDiffBetweenMN (line 11) | public static int countDiffBetweenMN(int m, int n) {
    method main (line 22) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_15_IsPowerOf2.java
  class Ex_15_IsPowerOf2 (line 3) | public class Ex_15_IsPowerOf2 {
    method isPowerOf2 (line 12) | public static boolean isPowerOf2(int n) {
    method main (line 26) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_16_Power.java
  class Ex_16_Power (line 3) | public class Ex_16_Power {
    method Power (line 14) | public static double Power(double base, int exponent) {
    method PowerWithUnsignedExponent (line 33) | public static double PowerWithUnsignedExponent(double base, int expone...
    method PowerWithUnsignedExponentOptimal (line 43) | public static double PowerWithUnsignedExponentOptimal(double base, int...

FILE: offer/src/com/ex/offer/Ex_17_AddTwoBigNumber.java
  class Ex_17_AddTwoBigNumber (line 3) | public class Ex_17_AddTwoBigNumber {
    method add (line 18) | public static String add(StringBuffer n1, StringBuffer n2) {
    method main (line 68) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_17_Print1ToMaxNDigits.java
  class Ex_17_Print1ToMaxNDigits (line 3) | public class Ex_17_Print1ToMaxNDigits {
    method print1ToMaxNDigits_1 (line 9) | public static void print1ToMaxNDigits_1 (int n) {
    method print1ToMaxNDigits_2 (line 33) | public static void print1ToMaxNDigits_2 (int n) {
    method print1ToMaxNDigits_3 (line 53) | public static void print1ToMaxNDigits_3 (int n) {
    method print1ToMaxNDigits_3_Recur (line 75) | public static void print1ToMaxNDigits_3_Recur(StringBuffer s, int n, i...
    method Increment (line 87) | public static boolean Increment(StringBuffer s) {
    method printNumber (line 120) | public static void printNumber(StringBuffer s) {
    method main (line 136) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_18_DeleteDuplicatedNode.java
  class Ex_18_DeleteDuplicatedNode (line 3) | public class Ex_18_DeleteDuplicatedNode {
    method deleteDuplication (line 5) | public static ListNode deleteDuplication (ListNode pHead) {
    method deleteDuplication1 (line 30) | public static ListNode deleteDuplication1 (ListNode pHead) {
    method main (line 67) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_18_DeleteNodeInSList.java
  class Ex_18_DeleteNodeInSList (line 3) | public class Ex_18_DeleteNodeInSList {
    method deleteNode (line 5) | public static Node deleteNode(Node head, Node toBeDeleted) {
    method main (line 30) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_19_Match.java
  class Ex_19_Match (line 14) | public class Ex_19_Match {
    method match (line 16) | public boolean match(char[] str, char[] pattern) {
    method matchCore (line 24) | private boolean matchCore(char[] str, int strIndex, char[] pattern, in...

FILE: offer/src/com/ex/offer/Ex_20_IsNumber.java
  class Ex_20_IsNumber (line 5) | public class Ex_20_IsNumber {
    method isNumeric (line 13) | public boolean isNumeric(char[] str) {
    method scanInteger (line 33) | private boolean scanInteger(char[] str) {
    method scanUnsignedInteger (line 41) | private boolean scanUnsignedInteger(char[] str) {
    method isNumberic1 (line 58) | public boolean isNumberic1(char[] str) {
    method test (line 63) | @Test

FILE: offer/src/com/ex/offer/Ex_21_ReOrderArray.java
  class Ex_21_ReOrderArray (line 5) | public class Ex_21_ReOrderArray {
    method reOrderArray (line 7) | public void reOrderArray(int [] array) {
    method reOrderArray1 (line 38) | public void reOrderArray1(int [] array) {
    method reOrderArray2 (line 60) | public void reOrderArray2(int [] array) {
    method swap (line 74) | private void swap(int[] array, int i, int j) {
    method test (line 81) | @Test

FILE: offer/src/com/ex/offer/Ex_22_FindKthNodeToTail.java
  class Ex_22_FindKthNodeToTail (line 5) | public class Ex_22_FindKthNodeToTail {
    method FindKthToTail (line 14) | public ListNode FindKthToTail(ListNode head, int k) {
    method test (line 35) | @Test

FILE: offer/src/com/ex/offer/Ex_22_FindMedianNodeInList.java
  class Ex_22_FindMedianNodeInList (line 5) | public class Ex_22_FindMedianNodeInList {
    method findMedian (line 7) | public ListNode findMedian(ListNode head) {
    method test (line 21) | @Test

FILE: offer/src/com/ex/offer/Ex_23_EntryNodeInList.java
  class Ex_23_EntryNodeInList (line 3) | public class Ex_23_EntryNodeInList {
    method EntryNodeOfLoop (line 5) | public ListNode EntryNodeOfLoop(ListNode pHead) {

FILE: offer/src/com/ex/offer/Ex_24_ReverseSList.java
  class Ex_24_ReverseSList (line 3) | public class Ex_24_ReverseSList {
    method ReverseList (line 5) | public ListNode ReverseList(ListNode head) {
    method reverseList (line 23) | public ListNode reverseList(ListNode head) {

FILE: offer/src/com/ex/offer/Ex_25_MergeList.java
  class Ex_25_MergeList (line 5) | public class Ex_25_MergeList {
    method Merge (line 7) | public ListNode Merge(ListNode list1, ListNode list2) {
    method Merge1 (line 24) | public ListNode Merge1(ListNode list1, ListNode list2) {
    method test (line 68) | @Test
    method test1 (line 81) | @Test

FILE: offer/src/com/ex/offer/Ex_26_IsSubTree.java
  class Ex_26_IsSubTree (line 4) | public class Ex_26_IsSubTree {
    method HasSubtree (line 6) | public boolean HasSubtree(TreeNode root1, TreeNode root2) {
    method doesTree1HasTree2 (line 12) | public boolean doesTree1HasTree2(TreeNode root1, TreeNode root2) {

FILE: offer/src/com/ex/offer/Ex_27_MirrorOfTree.java
  class Ex_27_MirrorOfTree (line 3) | public class Ex_27_MirrorOfTree {
    method Mirror (line 5) | public void Mirror(TreeNode root) {
    method swapLeftAndRight (line 17) | public void swapLeftAndRight(TreeNode root) {

FILE: offer/src/com/ex/offer/Ex_28_SymmetricalTree.java
  class Ex_28_SymmetricalTree (line 3) | public class Ex_28_SymmetricalTree {
    method isSymmetrical (line 4) | boolean isSymmetrical(TreeNode pRoot) {
    method isSymmetrical (line 11) | boolean isSymmetrical(TreeNode pRoot1, TreeNode pRoot2) {
    method doesTree1HasTree2 (line 25) | public boolean doesTree1HasTree2(TreeNode root1, TreeNode root2) {

FILE: offer/src/com/ex/offer/Ex_29_PrintMatrixWithClockWise.java
  class Ex_29_PrintMatrixWithClockWise (line 5) | public class Ex_29_PrintMatrixWithClockWise {
    method printMatrix (line 6) | public ArrayList<Integer> printMatrix(int [][] matrix) {
    method printMatrixWithCircle (line 28) | public ArrayList<Integer> printMatrixWithCircle(int[][] matrix, int r1...

FILE: offer/src/com/ex/offer/Ex_30_StackWithMinFunction.java
  class Ex_30_StackWithMinFunction (line 5) | public class Ex_30_StackWithMinFunction {
    method push (line 9) | public void push(int node) {
    method pop (line 23) | public void pop() {
    method top (line 30) | public int top() {
    method min (line 37) | public int min() {

FILE: offer/src/com/ex/offer/Ex_31_IsPopOrder.java
  class Ex_31_IsPopOrder (line 5) | public class Ex_31_IsPopOrder {
    method IsPopOrder (line 6) | public boolean IsPopOrder(int [] pushA,int [] popA) {

FILE: offer/src/com/ex/offer/Ex_32_PrintTreeByLayer.java
  class Ex_32_PrintTreeByLayer (line 7) | public class Ex_32_PrintTreeByLayer {
    method Print (line 9) | ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {

FILE: offer/src/com/ex/offer/Ex_32_PrintTreeWithZhi.java
  class Ex_32_PrintTreeWithZhi (line 6) | public class Ex_32_PrintTreeWithZhi {
    method Print (line 8) | public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
    method Print1 (line 71) | public ArrayList<ArrayList<Integer>> Print1(TreeNode pRoot) {

FILE: offer/src/com/ex/offer/Ex_32_TraverseTreeByLayer.java
  class Ex_32_TraverseTreeByLayer (line 22) | public class Ex_32_TraverseTreeByLayer {
    method PrintFromTopToBottom (line 24) | public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {

FILE: offer/src/com/ex/offer/Ex_33_VerifySequenceOfBST.java
  class Ex_33_VerifySequenceOfBST (line 5) | public class Ex_33_VerifySequenceOfBST {
    method VerifySequenceOfBST (line 6) | public boolean VerifySequenceOfBST(int [] sequence) {
    method verifySequence (line 14) | public boolean verifySequence(int[] sequence, int start, int end) {
    method test (line 58) | @Test

FILE: offer/src/com/ex/offer/Ex_34_FindPathInBT.java
  class Ex_34_FindPathInBT (line 7) | public class Ex_34_FindPathInBT {
    method FindPath (line 9) | public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int targe...
    method findPath (line 22) | private void findPath(TreeNode root,
    method test (line 45) | @Test

FILE: offer/src/com/ex/offer/Ex_34_FindPathInBT_1.java
  class Ex_34_FindPathInBT_1 (line 7) | public class Ex_34_FindPathInBT_1 {
    method FindPath (line 11) | public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int targe...
    method findPath (line 19) | private void findPath(TreeNode root, int target) {

FILE: offer/src/com/ex/offer/Ex_34_FindPathInBT_2.java
  class Ex_34_FindPathInBT_2 (line 5) | public class Ex_34_FindPathInBT_2 {
    method FindPath (line 9) | public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int targe...
    method findPath (line 17) | private void findPath(TreeNode root, int target, int sum) {

FILE: offer/src/com/ex/offer/Ex_35_CloneList.java
  class Ex_35_CloneList (line 6) | public class Ex_35_CloneList {
    method Clone (line 7) | public RandomListNode Clone(RandomListNode pHead)
    method Clone1 (line 47) | public RandomListNode Clone1(RandomListNode pHead)

FILE: offer/src/com/ex/offer/Ex_36_ConvertBetweenBSTAndDList.java
  class Ex_36_ConvertBetweenBSTAndDList (line 5) | public class Ex_36_ConvertBetweenBSTAndDList {
    method Convert (line 9) | public TreeNode Convert(TreeNode pRootOfTree) {
    method convert (line 14) | public void convert(TreeNode pRootOfTree) {
    method ConvertIterative (line 34) | public TreeNode ConvertIterative(TreeNode pRootOfTree) {

FILE: offer/src/com/ex/offer/Ex_37_SerializeBT.java
  class Ex_37_SerializeBT (line 3) | public class Ex_37_SerializeBT {
    method Serialize (line 4) | String Serialize(TreeNode root) {
    method serialize (line 15) | void serialize(TreeNode root, StringBuilder sb) {
    method Deserialize (line 27) | TreeNode Deserialize(String str) {
    method Deserialize (line 33) | TreeNode Deserialize(String[] strs) {

FILE: offer/src/com/ex/offer/Ex_38_EightQueen.java
  class Ex_38_EightQueen (line 12) | public class Ex_38_EightQueen {
    method solution (line 18) | public int solution() {
    method queen (line 23) | private void queen(int row) {
    method isPut (line 36) | private boolean isPut(int row) {
    method test (line 45) | @Test

FILE: offer/src/com/ex/offer/Ex_38_StringCombination.java
  class Ex_38_StringCombination (line 7) | public class Ex_38_StringCombination {
    method Combination (line 8) | public ArrayList<String> Combination(String str) {
    method combination (line 16) | private void combination(char[] chars, int startIndex, ArrayList<Strin...
    method test (line 34) | @Test

FILE: offer/src/com/ex/offer/Ex_38_StringPermutation.java
  class Ex_38_StringPermutation (line 6) | public class Ex_38_StringPermutation {
    method Permutation (line 7) | public ArrayList<String> Permutation(String str) {
    method permutation (line 16) | private void permutation(char[] chars, int startIndex, ArrayList<Strin...
    method swap (line 33) | private void swap(char[] chars, int i, int j) {

FILE: offer/src/com/ex/offer/Ex_39_KthSmallestNumInArrayWithoutSort.java
  class Ex_39_KthSmallestNumInArrayWithoutSort (line 3) | public class Ex_39_KthSmallestNumInArrayWithoutSort {
    method kthNumIte (line 11) | public static int kthNumIte(int[] arr, int K) {
    method kthNum (line 32) | public static int kthNum(int[] arr, int K) {
    method kthNum (line 55) | public static int kthNum(int[] arr, int K, int low, int high) {
    method partition (line 91) | public static int partition(int[] arr, int low, int high) {
    method swap (line 129) | public static void swap(int[] arr, int i, int j) {
    method main (line 135) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_39_MoreThanHalfNum.java
  class Ex_39_MoreThanHalfNum (line 3) | public class Ex_39_MoreThanHalfNum {
    method moreThanHalfNum (line 5) | public static int moreThanHalfNum(int[] array) {
    method checkMoreThanHalf (line 36) | public static boolean checkMoreThanHalf(int[] arr, int result) {
    method partition (line 52) | public static int partition(int[] arr, int low, int high) {
    method swap (line 88) | public static void swap(int[] arr, int i, int j) {
    method moreThanHalfNumWithoutChangeArray (line 94) | public static int moreThanHalfNumWithoutChangeArray(int[] array) {
    method main (line 120) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_40_GetLeastKNumbers.java
  class Ex_40_GetLeastKNumbers (line 5) | public class Ex_40_GetLeastKNumbers {
    method getLeastKNumbers (line 7) | public static ArrayList<Integer> getLeastKNumbers(int[] input, int k) {
    method kthNum (line 31) | public static int kthNum(int[] input, int k) {
    method partition (line 51) | public static int partition(int[] arr, int low, int high) {
    method swap (line 81) | public static void swap(int[] arr, int i, int j) {
    method main (line 87) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_41_MedianInDataFlow.java
  class Ex_41_MedianInDataFlow (line 6) | public class Ex_41_MedianInDataFlow {
    method Insert (line 11) | public void Insert(Integer num) {
    method GetMedian (line 35) | public Double GetMedian() {
    method modifyTwoHeapSize (line 54) | private void modifyTwoHeapSize() {
    class MinHeapComparator (line 64) | private static class MinHeapComparator implements Comparator<Integer> {
      method compare (line 66) | @Override
    class MaxHeapComparator (line 76) | private static class MaxHeapComparator implements Comparator<Integer> {
      method compare (line 77) | @Override

FILE: offer/src/com/ex/offer/Ex_42_MaxSumOfSubArray.java
  class Ex_42_MaxSumOfSubArray (line 4) | public class Ex_42_MaxSumOfSubArray {
    method FindGreatestSumOfSubArray (line 5) | public int FindGreatestSumOfSubArray(int[] array) {

FILE: offer/src/com/ex/offer/Ex_43_NumberOf1Between1AndN.java
  class Ex_43_NumberOf1Between1AndN (line 4) | public class Ex_43_NumberOf1Between1AndN {
    method NumberOf1Between1AndN_Solution1 (line 5) | public int NumberOf1Between1AndN_Solution1(int n) {
    method numberOf1 (line 18) | private int numberOf1(int num) {
    method NumberOf1Between1AndN_Solution (line 30) | public int NumberOf1Between1AndN_Solution(int n) {

FILE: offer/src/com/ex/offer/Ex_44_ANumInArray.java
  class Ex_44_ANumInArray (line 5) | public class Ex_44_ANumInArray {
    method digitAt (line 6) | public int digitAt(int index) {
    method countNumbersOf (line 24) | private int countNumbersOf(int digits) {
    method digitAt (line 32) | private int digitAt(int index, int digits) {
    method test (line 43) | @Test

FILE: offer/src/com/ex/offer/Ex_45_MinNumByConcatArray.java
  class Ex_45_MinNumByConcatArray (line 7) | public class Ex_45_MinNumByConcatArray {
    method PrintMinNumber (line 8) | public String PrintMinNumber(int [] numbers) {
    class StrComparator (line 28) | private static class StrComparator implements Comparator<String> {
      method compare (line 30) | @Override

FILE: offer/src/com/ex/offer/Ex_46_ConvertStringToIP.java
  class Ex_46_ConvertStringToIP (line 16) | public class Ex_46_ConvertStringToIP {
    method convertStringToIp1 (line 18) | public static int convertStringToIp1(String str) {
    method process1 (line 34) | public static int process1(char[] chars, int i, int parts) {
    method convertStringToIp2 (line 65) | public static int convertStringToIp2(String str) {
    method getRandomNumberString (line 97) | public static String getRandomNumberString() {
    method main (line 105) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/Ex_46_TranslationFromIntToString.java
  class Ex_46_TranslationFromIntToString (line 8) | public class Ex_46_TranslationFromIntToString {
    method translation (line 10) | public int translation(int num) {
    method translation1 (line 42) | public int translation1(int num) {
    method translationCore (line 53) | private int translationCore(char[] chars, int start) {
    method test (line 76) | @Test

FILE: offer/src/com/ex/offer/Ex_47_MaxGiftValue.java
  class Ex_47_MaxGiftValue (line 5) | public class Ex_47_MaxGiftValue {
    method getMaxValue (line 6) | public int getMaxValue(int[][] matrix) {
    method getMaxValue1 (line 33) | public int getMaxValue1(int[][] matrix) {
    method process (line 41) | private int process(int[][] matrix, int startRow, int startCol) {
    method test (line 64) | @Test

FILE: offer/src/com/ex/offer/Ex_48_LongestSubStringWithDuplication.java
  class Ex_48_LongestSubStringWithDuplication (line 6) | public class Ex_48_LongestSubStringWithDuplication {
    method longestSubString (line 7) | public int longestSubString(String str) {
    method test (line 40) | @Test

FILE: offer/src/com/ex/offer/Ex_49_UglyNumber.java
  class Ex_49_UglyNumber (line 5) | public class Ex_49_UglyNumber {
    method getUglyNumber (line 7) | public int getUglyNumber(int index) {
    method min (line 41) | private int min(int x, int y, int z) {
    method getUglyNumber1 (line 47) | public int getUglyNumber1(int index) {
    method isUgly (line 67) | public boolean isUgly(int number) {
    method test (line 87) | @Test

FILE: offer/src/com/ex/offer/Ex_50_FirstNotRepeatedChar.java
  class Ex_50_FirstNotRepeatedChar (line 5) | public class Ex_50_FirstNotRepeatedChar {
    method FirstNotRepeatingChar (line 6) | public int FirstNotRepeatingChar(String str) {
    method FirstNotRepeatingChar1 (line 34) | public int FirstNotRepeatingChar1(String str) {

FILE: offer/src/com/ex/offer/Ex_50_FirstNotRepeatedCharInDataFlow.java
  class Ex_50_FirstNotRepeatedCharInDataFlow (line 3) | public class Ex_50_FirstNotRepeatedCharInDataFlow {
    method Ex_50_FirstNotRepeatedCharInDataFlow (line 15) | public Ex_50_FirstNotRepeatedCharInDataFlow() {
    method Insert (line 22) | public void Insert(char ch)
    method FirstAppearingOnce (line 33) | public char FirstAppearingOnce()

FILE: offer/src/com/ex/offer/Ex_50_StringUtilsSolutions.java
  class Ex_50_StringUtilsSolutions (line 7) | public class Ex_50_StringUtilsSolutions {
    method deleteString (line 9) | public String deleteString(String str1, String str2) {
    method deleteDuplicatedChar (line 29) | public String deleteDuplicatedChar(String str) {
    method isAnagram (line 58) | public boolean isAnagram(String str1, String str2) {
    method testDeleteString (line 86) | @Test
    method testDeleteDuplicatedChar (line 93) | @Test
    method testIsAnagram (line 99) | @Test

FILE: offer/src/com/ex/offer/Ex_51_InversePairs.java
  class Ex_51_InversePairs (line 5) | public class Ex_51_InversePairs {
    method InversePairs (line 6) | public int InversePairs(int [] array) {
    method mergeSort (line 16) | private int mergeSort(int[] array, int low, int high) {
    method merge (line 28) | private int merge(int[] array, int low, int mid, int high) {

FILE: offer/src/com/ex/offer/Ex_51_InversePairs_BigData.java
  class Ex_51_InversePairs_BigData (line 5) | public class Ex_51_InversePairs_BigData {
    method InversePairs (line 6) | public int InversePairs(int [] array) {
    method mergeSort (line 16) | private int mergeSort(int[] array, int low, int high) {
    method merge (line 29) | private int merge(int[] array, int low, int mid, int high) {

FILE: offer/src/com/ex/offer/Ex_52_FirstCommonNode.java
  class Ex_52_FirstCommonNode (line 3) | public class Ex_52_FirstCommonNode {
    method FindFirstCommonNode (line 4) | public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
    method getLengthOfList (line 28) | private int getLengthOfList(ListNode pHead1) {

FILE: offer/src/com/ex/offer/Ex_53_GetMissingNumber.java
  class Ex_53_GetMissingNumber (line 3) | public class Ex_53_GetMissingNumber {
    method getMissingNumber (line 4) | public int getMissingNumber(int[] array) {

FILE: offer/src/com/ex/offer/Ex_53_GetNumberOfK.java
  class Ex_53_GetNumberOfK (line 5) | public class Ex_53_GetNumberOfK {
    method GetNumberOfK (line 6) | public int GetNumberOfK(int [] array , int k) {
    method getFirstIndexOfK (line 21) | private int getFirstIndexOfK(int[] array, int k, int low, int high) {
    method getLastIndexOfK (line 43) | private int getLastIndexOfK(int[] array, int k, int low, int high) {
    method test (line 65) | @Test

FILE: offer/src/com/ex/offer/Ex_53_GetNumberSameAsIndex.java
  class Ex_53_GetNumberSameAsIndex (line 5) | public class Ex_53_GetNumberSameAsIndex {
    method getNumberSameAsIndex (line 7) | public int getNumberSameAsIndex(int[] array) {
    method test (line 31) | @Test

FILE: offer/src/com/ex/offer/Ex_54_KthNodeInBST.java
  class Ex_54_KthNodeInBST (line 3) | public class Ex_54_KthNodeInBST {
    method KthNode (line 7) | TreeNode KthNode(TreeNode pRoot, int k)

FILE: offer/src/com/ex/offer/Ex_55_BalancedBT.java
  class Ex_55_BalancedBT (line 3) | public class Ex_55_BalancedBT {
    method IsBalanced_Solution (line 8) | public boolean IsBalanced_Solution(TreeNode root) {
    method isBalance (line 12) | private boolean isBalance(TreeNode root) {
    method IsBalanced_Solution1 (line 34) | public boolean IsBalanced_Solution1(TreeNode root) {
    method isBalance (line 38) | public boolean isBalance(TreeNode root, int[] depth) {
    method IsBalanced_Solution2 (line 57) | public boolean IsBalanced_Solution2(TreeNode root) {
    method TreeDepth (line 73) | private int TreeDepth(TreeNode root) {
    method IsBalanced_Solution3 (line 88) | public boolean IsBalanced_Solution3(TreeNode root) {
    method getDepth (line 94) | private int getDepth(TreeNode root) {

FILE: offer/src/com/ex/offer/Ex_55_DepthOfBT.java
  class Ex_55_DepthOfBT (line 3) | public class Ex_55_DepthOfBT {
    method TreeDepth (line 4) | public int TreeDepth(TreeNode root) {

FILE: offer/src/com/ex/offer/Ex_56_AppearanceOnce.java
  class Ex_56_AppearanceOnce (line 5) | public class Ex_56_AppearanceOnce {
    method FindNumsAppearOnce (line 6) | public void FindNumsAppearOnce(int [] array,int num1[] , int num2[]) {
    method findFirst1_Bit (line 28) | private int findFirst1_Bit(int num) {
    method is1_Bit (line 39) | private boolean is1_Bit(int num, int index) {

FILE: offer/src/com/ex/offer/Ex_56_AppearanceOnce_Continued.java
  class Ex_56_AppearanceOnce_Continued (line 5) | public class Ex_56_AppearanceOnce_Continued {
    method FindNumAppearOnce (line 6) | public int FindNumAppearOnce(int[] array) {
    method test (line 31) | @Test

FILE: offer/src/com/ex/offer/Ex_57_FindContinuousSequence.java
  class Ex_57_FindContinuousSequence (line 7) | public class Ex_57_FindContinuousSequence {
    method FindContinuousSequence (line 8) | public ArrayList<ArrayList<Integer>> FindContinuousSequence(int sum) {
    method full (line 37) | private ArrayList<Integer> full(int small, int big) {
    method test (line 45) | @Test

FILE: offer/src/com/ex/offer/Ex_57_FindNumbersWithSum.java
  class Ex_57_FindNumbersWithSum (line 7) | public class Ex_57_FindNumbersWithSum {
    method FindNumbersWithSum (line 8) | public ArrayList<Integer> FindNumbersWithSum(int [] array, int sum) {
    method test (line 54) | @Test

FILE: offer/src/com/ex/offer/Ex_58_ROL.java
  class Ex_58_ROL (line 5) | public class Ex_58_ROL {
    method LeftRotateString (line 6) | public String LeftRotateString(String str,int n) {
    method reverse (line 20) | private void reverse(char[] chars, int start, int end) {
    method test (line 28) | @Test

FILE: offer/src/com/ex/offer/Ex_58_ReverseSentence.java
  class Ex_58_ReverseSentence (line 5) | public class Ex_58_ReverseSentence {
    method ReverseSentence (line 6) | public String ReverseSentence(String str) {
    method reverse (line 40) | private void reverse(char[] chars, int start, int end) {
    method test (line 49) | @Test

FILE: offer/src/com/ex/offer/Ex_59_MaxNumOfSlidingWindow.java
  class Ex_59_MaxNumOfSlidingWindow (line 8) | public class Ex_59_MaxNumOfSlidingWindow {
    method maxInWindows (line 9) | public ArrayList<Integer> maxInWindows(int [] num, int size)
    method test (line 44) | @Test

FILE: offer/src/com/ex/offer/Ex_59_QueueWithMax.java
  class Ex_59_QueueWithMax (line 7) | public class Ex_59_QueueWithMax {
    method push_back (line 11) | public void push_back(Integer x) {
    method pop_front (line 21) | public Integer pop_front() {
    method max (line 30) | public Integer max() {

FILE: offer/src/com/ex/offer/Ex_60_ProbabilityOfS.java
  class Ex_60_ProbabilityOfS (line 7) | public class Ex_60_ProbabilityOfS {
    method printProbability_1 (line 11) | public void printProbability_1(int number) {
    method probability (line 31) | private void probability(int number, int[] sums) {
    method probability (line 43) | private void probability(int number, int current, int sum, int[] sums) {
    method printProbability_2 (line 62) | public void printProbability_2(int number) {
    method test1 (line 99) | @Test
    method test2 (line 105) | @Test

FILE: offer/src/com/ex/offer/Ex_61_ContinuousSequence.java
  class Ex_61_ContinuousSequence (line 5) | public class Ex_61_ContinuousSequence {
    method isContinuous (line 6) | public boolean isContinuous(int [] numbers) {

FILE: offer/src/com/ex/offer/Ex_62_Josephus.java
  class Ex_62_Josephus (line 10) | public class Ex_62_Josephus {
    method LastRemaining_Solution (line 11) | public int LastRemaining_Solution(int n, int m) {
    method LastRemaining_Solution1 (line 40) | public int LastRemaining_Solution1(int n, int m) {
    method test (line 51) | @Test

FILE: offer/src/com/ex/offer/Ex_63_MaxProfits.java
  class Ex_63_MaxProfits (line 6) | public class Ex_63_MaxProfits {
    method maxProfits (line 7) | public int maxProfits(int[] prices) {
    method test (line 30) | @Test

FILE: offer/src/com/ex/offer/Ex_64_SumFrom1ToN.java
  class Ex_64_SumFrom1ToN (line 5) | public class Ex_64_SumFrom1ToN {
    method Sum_Solution (line 6) | public int Sum_Solution(int n) {
    method test (line 12) | @Test

FILE: offer/src/com/ex/offer/Ex_65_AddWithoutCarry.java
  class Ex_65_AddWithoutCarry (line 3) | public class Ex_65_AddWithoutCarry {
    method Add (line 4) | public int Add(int num1,int num2) {

FILE: offer/src/com/ex/offer/Ex_65_SwapNumWithoutTemp.java
  class Ex_65_SwapNumWithoutTemp (line 3) | public class Ex_65_SwapNumWithoutTemp {
    method swap1 (line 4) | public int[] swap1 (int a, int b) {
    method swap2 (line 16) | public int[] swap2 (int a, int b) {

FILE: offer/src/com/ex/offer/Ex_66_ConstructMultiplyArray.java
  class Ex_66_ConstructMultiplyArray (line 3) | public class Ex_66_ConstructMultiplyArray {
    method multiply (line 4) | public int[] multiply(int[] A) {

FILE: offer/src/com/ex/offer/Ex_67_StringToInt.java
  class Ex_67_StringToInt (line 5) | public class Ex_67_StringToInt {
    method StrToInt (line 13) | public int StrToInt(String str) {
    method test (line 51) | @Test

FILE: offer/src/com/ex/offer/Ex_68_LowestCommonAncestor.java
  class Ex_68_LowestCommonAncestor (line 3) | public class Ex_68_LowestCommonAncestor {
    method commonAncestor (line 5) | public TreeNode commonAncestor(TreeNode root, TreeNode node1, TreeNode...

FILE: offer/src/com/ex/offer/ListNode.java
  class ListNode (line 7) | public class ListNode {
    method ListNode (line 11) | public ListNode(int val) {

FILE: offer/src/com/ex/offer/Node.java
  class Node (line 6) | public class Node {
    method Node (line 10) | Node (int val) {

FILE: offer/src/com/ex/offer/RandomListNode.java
  class RandomListNode (line 6) | public class RandomListNode {
    method RandomListNode (line 11) | RandomListNode(int label) {

FILE: offer/src/com/ex/offer/TestUtils.java
  class TestUtils (line 5) | public class TestUtils {
    method printArray (line 6) | public static void printArray(int[] arr) {
    method sort (line 13) | public static void sort(int[] arr) {
    method partition (line 17) | public static int partition(int[] arr, int low, int high) {
    method swap (line 54) | public static void swap(int[] arr, int i, int j) {
    method getDigitSum (line 61) | public static int getDigitSum(int x) {
    method isOdd (line 79) | public static boolean isOdd(int x) {
    method printStingToInt (line 87) | public static void printStingToInt(StringBuffer s) {
    method Increment (line 104) | public static boolean Increment(StringBuffer s) {
    method printList (line 133) | public static void printList(Node head) {
    method printList_ListNode (line 146) | public static void printList_ListNode(ListNode head) {
    method main (line 159) | public static void main(String[] args) {

FILE: offer/src/com/ex/offer/TreeLinkNode.java
  class TreeLinkNode (line 7) | public class TreeLinkNode {
    method TreeLinkNode (line 13) | TreeLinkNode(int val) {

FILE: offer/src/com/ex/offer/TreeNode.java
  class TreeNode (line 6) | public class TreeNode {
    method TreeNode (line 11) | TreeNode(int x) {

FILE: offer/src/com/ex/singleton/Singleton1.java
  class Singleton1 (line 4) | public class Singleton1 {
    method Singleton1 (line 11) | private Singleton1() {}
    method getInstance (line 14) | public static Singleton1 getInstance() {

FILE: offer/src/com/ex/singleton/Singleton2.java
  class Singleton2 (line 4) | public class Singleton2 {
    method Singleton2 (line 7) | private Singleton2() {}
    method getInstance (line 9) | public static Singleton2 getInstance() {

FILE: offer/src/com/ex/singleton/Singleton3.java
  class Singleton3 (line 4) | public class Singleton3 {
    method Singleton3 (line 9) | private Singleton3() {}
    method getInstance (line 11) | public static Singleton3 getInstance() {

FILE: offer/src/com/ex/singleton/Singleton4.java
  class Singleton4 (line 4) | public class Singleton4 {
    class SingletonHolder (line 5) | private static class SingletonHolder {
    method getInstance (line 9) | public static Singleton4 getInstance() {

FILE: offer/src/com/ex/singleton/Singleton5.java
  type Singleton5 (line 4) | public enum Singleton5 {
    method getId (line 9) | public int getId() {
    method setId (line 13) | public void setId(int id) {
    method main (line 17) | public static void main(String[] args) {

FILE: practice/src/io/gkd/ListNode.java
  class ListNode (line 3) | public class ListNode {
    method ListNode (line 7) | public ListNode() {
    method ListNode (line 10) | public ListNode(int val) {
    method ListNode (line 14) | public ListNode(int val, ListNode next) {

FILE: practice/src/io/gkd/Node.java
  class Node (line 5) | public class Node {
    method Node (line 9) | public Node() {}
    method Node (line 11) | public Node(int _val) {
    method Node (line 15) | public Node(int _val, List<Node> _children) {

FILE: practice/src/io/gkd/TreeNode.java
  class TreeNode (line 3) | public class TreeNode {
    method TreeNode (line 8) | public TreeNode() {}
    method TreeNode (line 10) | public TreeNode(int val) {
    method TreeNode (line 14) | public TreeNode(int val, TreeNode left, TreeNode right) {

FILE: practice/src/io/gkd/lectures/lecture04/Lc077_Combine.java
  class Lc077_Combine (line 6) | public class Lc077_Combine {
    method combine (line 8) | public List<List<Integer>> combine(int n, int k) {
    method findSubsets (line 15) | private void findSubsets(int index) {

FILE: practice/src/io/gkd/lectures/lecture04/Lc078_SubSets.java
  class Lc078_SubSets (line 10) | public class Lc078_SubSets {
    method subsets (line 12) | public List<List<Integer>> subsets(int[] nums) {
    method findSubsets (line 18) | private void findSubsets(int[] nums, int index) {

FILE: practice/src/io/gkd/lectures/lecture05/Lc094_InOrderTraversal.java
  class Lc094_InOrderTraversal (line 8) | public class Lc094_InOrderTraversal {
    method inorderTraversal (line 12) | public List<Integer> inorderTraversal(TreeNode root) {
    method find (line 17) | public void find(TreeNode root) {

FILE: practice/src/io/gkd/lectures/lecture05/Lc105_BuildTree.java
  class Lc105_BuildTree (line 19) | public class Lc105_BuildTree {
    method buildTree (line 20) | public TreeNode buildTree(int[] preorder, int[] inorder) {
    method build (line 24) | private TreeNode build(int[] preorder, int l1, int r1, int[] inorder, ...

FILE: practice/src/io/gkd/lectures/lecture05/Lc236_LCA.java
  class Lc236_LCA (line 16) | public class Lc236_LCA {
    method lowestCommonAncestor (line 22) | public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNo...
    method calcFather (line 41) | private void calcFather(TreeNode root) {

FILE: practice/src/io/gkd/lectures/lecture05/Lc297_Codec.java
  class Lc297_Codec (line 13) | public class Lc297_Codec {
    method serialize (line 22) | public String serialize(TreeNode root) {
    method deserialize (line 28) | public TreeNode deserialize(String data) {
    method calc (line 34) | private TreeNode calc() {
    method traverse (line 46) | private void traverse(TreeNode root) {

FILE: practice/src/io/gkd/lectures/lecture05/Lc429_LevelOrderNTree.java
  class Lc429_LevelOrderNTree (line 14) | public class Lc429_LevelOrderNTree {
    method levelOrder (line 16) | public List<List<Integer>> levelOrder(Node root) {
    class Pair (line 40) | static class Pair<K, V> {
      method Pair (line 45) | public Pair(K key, V value) {
      method getKey (line 50) | public K getKey() {
      method getValue (line 54) | public V getValue() {

FILE: practice/src/io/gkd/lectures/lecture05/Lc589_PreOrderNTree.java
  class Lc589_PreOrderNTree (line 13) | public class Lc589_PreOrderNTree {
    method preorder (line 16) | public List<Integer> preorder(Node root) {
    method find (line 21) | private void find(Node root) {
    method preorderIter (line 29) | public List<Integer> preorderIter(Node root) {

FILE: practice/src/io/gkd/week01/Lc021_MergeTwoLists.java
  class Lc021_MergeTwoLists (line 9) | public class Lc021_MergeTwoLists {
    method mergeTwoLists (line 11) | public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

FILE: practice/src/io/gkd/week01/Lc066_PlusOne.java
  class Lc066_PlusOne (line 7) | public class Lc066_PlusOne {
    method plusOne (line 9) | public int[] plusOne(int[] digits) {

FILE: practice/src/io/gkd/week02/Lc146_LRUCache.java
  class Lc146_LRUCache (line 11) | public class Lc146_LRUCache {
    method Lc146_LRUCache (line 20) | public Lc146_LRUCache(int capacity) {
    method get (line 30) | public int get(int key) {
    method put (line 42) | public void put(int key, int value) {
    method addToHead (line 57) | private void addToHead(Node node) {
    method removeNode (line 67) | private void removeNode(Node node) {
    class Node (line 72) | static class Node {
      method Node (line 78) | public Node() {}
      method Node (line 80) | public Node(int key, int val) {

FILE: practice/src/io/gkd/week02/Lc697_FindShortestSubArray.java
  class Lc697_FindShortestSubArray (line 10) | public class Lc697_FindShortestSubArray {
    method findShortestSubArray (line 11) | public int findShortestSubArray(int[] nums) {

FILE: practice/src/io/gkd/week03/Lc106_BuildTree.java
  class Lc106_BuildTree (line 17) | public class Lc106_BuildTree {
    method buildTree (line 18) | public TreeNode buildTree(int[] inorder, int[] postorder) {
    method build (line 22) | private TreeNode build(int[] inorder, int l1, int r1, int[] postorder,...

FILE: practice/src/io/gkd/week03/Lc210_FindOrder2.java
  class Lc210_FindOrder2 (line 6) | public class Lc210_FindOrder2 {
    method findOrder (line 7) | public int[] findOrder(int numCourses, int[][] prerequisites) {