SYMBOL INDEX (173 symbols across 32 files)

FILE: src/chapter1/part2/TimeComplex.java
  class TimeComplex (line 6) | public class TimeComplex {
    method eat1 (line 8) | void eat1(int n){
    method eat2 (line 16) | void eat2(int n){
    method eat3 (line 26) | void eat3(int n){
    method eat4 (line 31) | void eat4(int n){

FILE: src/chapter1/part3/SpaceComplex.java
  class SpaceComplex (line 6) | public class SpaceComplex {
    method fun1 (line 8) | void fun1(int n){
    method fun2 (line 13) | void fun2(int n){
    method fun3 (line 18) | void fun3(int n){
    method fun4 (line 23) | void fun4(int n){

FILE: src/chapter2/part1/MyArray.java
  class MyArray (line 6) | public class MyArray {
    method MyArray (line 11) | public MyArray(int capacity){
    method insert (line 21) | public void insert(int index, int element) throws Exception {
    method resize (line 42) | public void resize(){
    method delete (line 53) | public int delete(int index) throws Exception {
    method output (line 70) | public void output(){
    method main (line 76) | public static void main(String[] args) throws Exception {

FILE: src/chapter2/part2/MyLinkedList.java
  class MyLinkedList (line 6) | public class MyLinkedList {
    method insert (line 20) | public void insert(int index, int data) throws Exception {
    method remove (line 50) | public Node remove(int index) throws Exception {
    method get (line 83) | public Node get(int index) throws Exception {
    method output (line 97) | public void output(){
    class Node (line 108) | private static class Node {
      method Node (line 112) | Node(int data) {
    method main (line 117) | public static void main(String[] args) throws Exception {

FILE: src/chapter2/part3/MyQueue.java
  class MyQueue (line 6) | public class MyQueue {
    method MyQueue (line 12) | public MyQueue(int capacity){
    method enQueue (line 20) | public void enQueue(int element) throws Exception {
    method deQueue (line 31) | public int deQueue() throws Exception {
    method output (line 43) | public void output(){
    method main (line 49) | public static void main(String[] args) throws Exception {

FILE: src/chapter3/part2/BinaryTreeTraversal.java
  class BinaryTreeTraversal (line 9) | public class BinaryTreeTraversal {
    method createBinaryTree (line 15) | public static TreeNode createBinaryTree(LinkedList<Integer> inputList){
    method preOrderTraversal (line 34) | public static void preOrderTraversal(TreeNode node){
    method inOrderTraversal (line 47) | public static void inOrderTraversal(TreeNode node){
    method postOrderTraversal (line 61) | public static void postOrderTraversal(TreeNode node){
    class TreeNode (line 73) | private static class TreeNode {
      method TreeNode (line 78) | TreeNode(int data) {
    method main (line 83) | public static void main(String[] args) {

FILE: src/chapter3/part2/BinaryTreeTraversalLevel.java
  class BinaryTreeTraversalLevel (line 10) | public class BinaryTreeTraversalLevel {
    method createBinaryTree (line 16) | public static TreeNode createBinaryTree(LinkedList<Integer> inputList){
    method levelOrderTraversal (line 35) | public static void levelOrderTraversal(TreeNode root){
    class TreeNode (line 53) | private static class TreeNode {
      method TreeNode (line 58) | TreeNode(int data) {
    method main (line 63) | public static void main(String[] args) {

FILE: src/chapter3/part2/BinaryTreeTraversalStack.java
  class BinaryTreeTraversalStack (line 10) | public class BinaryTreeTraversalStack {
    method createBinaryTree (line 16) | public static TreeNode createBinaryTree(LinkedList<Integer> inputList){
    method preOrderTraveralWithStack (line 35) | public static void preOrderTraveralWithStack(TreeNode root){
    class TreeNode (line 56) | private static class TreeNode {
      method TreeNode (line 61) | TreeNode(int data) {
    method main (line 66) | public static void main(String[] args) {

FILE: src/chapter3/part3/HeapOperator.java
  class HeapOperator (line 8) | public class HeapOperator {
    method upAdjust (line 14) | public static void upAdjust(int[] array) {
    method downAdjust (line 35) | public static void downAdjust(int[] array, int parentIndex, int length) {
    method buildHeap (line 59) | public static void buildHeap(int[] array) {
    method main (line 66) | public static void main(String[] args) {

FILE: src/chapter3/part4/PriorityQueue.java
  class PriorityQueue (line 8) | public class PriorityQueue {
    method PriorityQueue (line 13) | public PriorityQueue(){
    method enQueue (line 22) | public void enQueue(int key) {
    method deQueue (line 34) | public int deQueue() throws Exception {
    method upAdjust (line 49) | private void upAdjust() {
    method downAdjust (line 67) | private void downAdjust() {
    method resize (line 91) | private void resize() {
    method main (line 97) | public static void main(String[] args) throws Exception {

FILE: src/chapter4/part2/BubbleSort.java
  class BubbleSort (line 5) | public class BubbleSort {
    method sort (line 7) | public static void sort(int array[])
    method main (line 39) | public static void main(String[] args){

FILE: src/chapter4/part2/CockTailSort.java
  class CockTailSort (line 5) | public class CockTailSort {
    method sort (line 7) | public static void sort(int array[])
    method main (line 50) | public static void main(String[] args){

FILE: src/chapter4/part3/QuickSort.java
  class QuickSort (line 8) | public class QuickSort {
    method quickSort (line 10) | public static void quickSort(int[] arr, int startIndex, int endIndex) {
    method partition (line 28) | private static int partition(int[] arr, int startIndex, int endIndex) {
    method partitionV2 (line 64) | private static int partitionV2(int[] arr, int startIndex, int endIndex) {
    method main (line 83) | public static void main(String[] args) {

FILE: src/chapter4/part3/QuickSortWithStack.java
  class QuickSortWithStack (line 11) | public class QuickSortWithStack {
    method quickSort (line 13) | public static void quickSort(int[] arr, int startIndex, int endIndex) {
    method partition (line 50) | private static int partition(int[] arr, int startIndex, int endIndex) {
    method main (line 69) | public static void main(String[] args) {

FILE: src/chapter4/part4/HeapSort.java
  class HeapSort (line 8) | public class HeapSort {
    method downAdjust (line 16) | public static void downAdjust(int[] array, int parentIndex, int length) {
    method heapSort (line 40) | public static void heapSort(int[] array) {
    method main (line 57) | public static void main(String[] args) {

FILE: src/chapter4/part5/BucketSort.java
  class BucketSort (line 11) | public class BucketSort {
    method bucketSort (line 13) | public static double[] bucketSort(double[] array){
    method main (line 59) | public static void main(String[] args) {

FILE: src/chapter4/part5/CountSort.java
  class CountSort (line 8) | public class CountSort {
    method countSort (line 10) | public static int[] countSort(int[] array) {
    method countSortV2 (line 35) | public static int[] countSortV2(int[] array) {
    method main (line 66) | public static void main(String[] args) {

FILE: src/chapter5/part10/BigNumberSum.java
  class BigNumberSum (line 6) | public class BigNumberSum {
    method bigNumberSum (line 13) | public static String bigNumberSum(String bigNumberA, String bigNumberB) {
    method main (line 54) | public static void main(String[] args) {

FILE: src/chapter5/part11/GoldMining.java
  class GoldMining (line 6) | public class GoldMining {
    method getBestGoldMiningV3 (line 14) | public static int getBestGoldMiningV3(int w, int[] p, int[] g){
    method getBestGoldMiningV2 (line 35) | public static int getBestGoldMiningV2(int w, int[] p, int[] g){
    method getBestGoldMining (line 59) | public static int getBestGoldMining(int w, int n, int[] p, int[] g){
    method main (line 70) | public static void main(String[] args) {

FILE: src/chapter5/part12/FindLostNum.java
  class FindLostNum (line 6) | public class FindLostNum {
    method findLostNum (line 8) | public static int[] findLostNum(int[] array) {
    method main (line 37) | public static void main(String[] args) {

FILE: src/chapter5/part2/LinkedListCycle.java
  class LinkedListCycle (line 6) | public class LinkedListCycle {
    method isCycle (line 12) | public static boolean isCycle(Node head) {
    class Node (line 28) | private static class Node {
      method Node (line 31) | Node(int data) {
    method main (line 36) | public static void main(String[] args) throws Exception {

FILE: src/chapter5/part3/MinStack.java
  class MinStack (line 8) | public class MinStack {
    method push (line 17) | public void push(int element) {
    method pop (line 28) | public Integer pop() {
    method getMin (line 39) | public int getMin() throws Exception {
    method main (line 47) | public static void main(String[] args) throws Exception {

FILE: src/chapter5/part4/GreatestCommonDivisor.java
  class GreatestCommonDivisor (line 6) | public class GreatestCommonDivisor {
    method getGreatestCommonDivisor (line 8) | public static int getGreatestCommonDivisor(int a, int b){
    method getGreatestCommonDivisorV2 (line 22) | public static int getGreatestCommonDivisorV2(int a, int b){
    method getGreatestCommonDivisorV3 (line 31) | public static int getGreatestCommonDivisorV3(int a, int b){
    method gcd (line 40) | public static int gcd(int a, int b){
    method main (line 57) | public static void main(String[] args) {

FILE: src/chapter5/part5/PowerOf2.java
  class PowerOf2 (line 6) | public class PowerOf2 {
    method isPowerOf2 (line 8) | public static boolean isPowerOf2(int num) {
    method isPowerOf2V2 (line 19) | public static boolean isPowerOf2V2(int num) {
    method isPowerOf2V3 (line 30) | public static boolean isPowerOf2V3(int num) {
    method main (line 34) | public static void main(String[] args) {

FILE: src/chapter5/part6/MaxSortedDistance.java
  class MaxSortedDistance (line 7) | public class MaxSortedDistance {
    method getMaxSortedDistance (line 9) | public static int getMaxSortedDistance(int[] array){
    class Bucket (line 66) | private static class Bucket {
    method main (line 71) | public static void main(String[] args) {

FILE: src/chapter5/part7/StackQueue.java
  class StackQueue (line 8) | public class StackQueue {
    method enQueue (line 17) | public void enQueue(int element) {
    method deQueue (line 24) | public Integer deQueue() {
    method transfer (line 37) | private void transfer(){
    method main (line 43) | public static void main(String[] args) throws Exception {

FILE: src/chapter5/part8/FindNearestNumber.java
  class FindNearestNumber (line 8) | public class FindNearestNumber {
    method findNearestNumber (line 10) | public static int[] findNearestNumber(int[] numbers){
    method findTransferPoint (line 26) | private static int findTransferPoint(int[] numbers){
    method exchangeHead (line 35) | private static int[] exchangeHead(int[] numbers, int index){
    method reverse (line 47) | private static int[] reverse(int[] num, int index){
    method main (line 56) | public static void main(String[] args) {
    method outputNumbers (line 66) | private static void outputNumbers(int[] numbers){

FILE: src/chapter5/part9/RemoveKDigits.java
  class RemoveKDigits (line 6) | public class RemoveKDigits {
    method removeKDigits (line 13) | public static String removeKDigits(String num, int k) {
    method removeKDigitsV2 (line 50) | public static String removeKDigitsV2(String num, int k) {
    method main (line 79) | public static void main(String[] args) {

FILE: src/chapter6/part2/MyBitmap.java
  class MyBitmap (line 6) | public class MyBitmap {
    method MyBitmap (line 13) | public MyBitmap(int size) {
    method getBit (line 22) | public boolean getBit(int bitIndex) {
    method setBit (line 34) | public void setBit(int bitIndex) {
    method getWordIndex (line 46) | private int getWordIndex(int bitIndex) {
    method main (line 51) | public static void main(String[] args) {

FILE: src/chapter6/part3/LRUCache.java
  class LRUCache (line 6) | public class LRUCache {
    method LRUCache (line 15) | public LRUCache(int limit) {
    method get (line 20) | public String get(String key) {
    method put (line 29) | public void put(String key, String value) {
    method remove (line 47) | public void remove(String key) {
    method refreshNode (line 60) | private void refreshNode(Node node) {
    method removeNode (line 75) | private String removeNode(Node node) {
    method addNode (line 100) | private void addNode(Node node) {
    class Node (line 112) | class Node {
      method Node (line 113) | Node(String key, String value){
    method main (line 123) | public static void main(String[] args) {

FILE: src/chapter6/part4/AStar.java
  class AStar (line 5) | public class AStar {
    method aStarSearch (line 21) | public static Grid aStarSearch(Grid start, Grid end) {
    method findMinGird (line 52) | private static Grid findMinGird(ArrayList<Grid> openList) {
    method findNeighbors (line 62) | private static ArrayList<Grid> findNeighbors(Grid grid, List<Grid> ope...
    method isValidGrid (line 79) | private static boolean isValidGrid(int x, int y, List<Grid> openList, ...
    method containGrid (line 99) | private static boolean containGrid(List<Grid> grids, int x, int y) {
    class Grid (line 108) | static class Grid {
      method Grid (line 116) | public Grid(int x, int y) {
      method initGrid (line 121) | public void initGrid(Grid parent, Grid end){
    method main (line 129) | public static void main(String[] args) {

FILE: src/chapter6/part5/Redpackage.java
  class Redpackage (line 9) | public class Redpackage {
    method divideRedPackage (line 16) | public static List<Integer> divideRedPackage(Integer totalAmount, Inte...
    method divideRedPackageV2 (line 37) | public static List<Integer> divideRedPackageV2(Integer totalAmount, In...
    method main (line 66) | public static void main(String[] args){