package chapter2;
// 2.1 To the HighArray class in the highArray.java program (Listing 2.3), add a
// method called getMax() that returns the value of the highest key in the array,
// or –1 if the array is empty. Add some code in main() to exercise this method.
// You can assume all the keys are positive numbers.
// highArray.java
// demonstrates array class with high-level interface
// to run this program: C>java HighArrayApp
////////////////////////////////////////////////////////////////
class HighArray
{
private long[] a; // ref to array a
private int nElems; // number of data items
//-----------------------------------------------------------
public HighArray(int max) // constructor
{
a = new long[max]; // create the array
nElems = 0; // no items yet
}
//-----------------------------------------------------------
public boolean find(long searchKey)
{ // find specified value
int j;
for(j=0; j<nElems; j++) // for each element,
if(a[j] == searchKey) // found item?
break; // exit loop before end
if(j == nElems) // gone to end?
return false; // yes, can't find it
else
return true; // no, found it
} // end find()
//-----------------------------------------------------------
public void insert(long value) // put element into array
{
a[nElems] = value; // insert it
nElems++; // increment size
}
//-----------------------------------------------------------
public boolean delete(long value)
{
int j;
for(j=0; j<nElems; j++) // look for it
if( value == a[j] )
break;
if(j==nElems) // can't find it
return false;
else // found it
{
for(int k=j; k<nElems; k++) // move higher ones down
a[k] = a[k+1];
nElems--; // decrement size
return true;
}
} // end delete()
//-----------------------------------------------------------
public void display() // displays array contents
{
for(int j=0; j<nElems; j++) // for each element,
System.out.print(a[j] + " "); // display it
System.out.println("");
}
//-----------------------------------------------------------
// start here
public long getMax() {
if(nElems == 0) {
return -1; //数组为空
}
long max = a[0];
for(int j = 1; j < nElems; j++) {
if(max < a[j]) {
max = a[j];
}
}
return max;
}
// end here
} // end class HighArray
////////////////////////////////////////////////////////////////
class HighArrayApp
{
public static void main(String[] args)
{
int maxSize = 100; // array size
HighArray arr; // reference to array
arr = new HighArray(maxSize); // create the array
arr.insert(77); // insert 10 items
arr.insert(99);
arr.insert(44);
arr.insert(55);
arr.insert(22);
arr.insert(88);
arr.insert(11);
arr.insert(00);
arr.insert(66);
arr.insert(33);
arr.display(); // display items
int searchKey = 35; // search for item
if( arr.find(searchKey) )
System.out.println("Found " + searchKey);
else
System.out.println("Can't find " + searchKey);
arr.delete(00); // delete 3 items
arr.delete(55);
arr.delete(99);
arr.display(); // display items again
// start here
System.out.println(arr.getMax());
// end here
} // end main()
} // end class HighArrayApp
77 99 44 55 22 88 11 0 66 33
Can't find 35
77 44 22 88 11 66 33
88
package chapter2;
// Modify the method in Programming Project 2.1 so that the item with the
// highest key is not only returned by the method, but also removed from the
// array. Call the method removeMax().
// highArray.java
// demonstrates array class with high-level interface
// to run this program: C>java HighArrayApp
////////////////////////////////////////////////////////////////
class HighArray
{
private long[] a; // ref to array a
private int nElems; // number of data items
//-----------------------------------------------------------
public HighArray(int max) // constructor
{
a = new long[max]; // create the array
nElems = 0; // no items yet
}
//-----------------------------------------------------------
public boolean find(long searchKey)
{ // find specified value
int j;
for(j=0; j<nElems; j++) // for each element,
if(a[j] == searchKey) // found item?
break; // exit loop before end
if(j == nElems) // gone to end?
return false; // yes, can't find it
else
return true; // no, found it
} // end find()
//-----------------------------------------------------------
public void insert(long value) // put element into array
{
a[nElems] = value; // insert it
nElems++; // increment size
}
//-----------------------------------------------------------
public boolean delete(long value)
{
int j;
for(j=0; j<nElems; j++) // look for it
if( value == a[j] )
break;
if(j==nElems) // can't find it
return false;
else // found it
{
for(int k=j; k<nElems; k++) // move higher ones down
a[k] = a[k+1];
nElems--; // decrement size
return true;
}
} // end delete()
//-----------------------------------------------------------
public void display() // displays array contents
{
for(int j=0; j<nElems; j++) // for each element,
System.out.print(a[j] + " "); // display it
System.out.println("");
}
//-----------------------------------------------------------
// start here
public long getMax() {
if(nElems == 0) {
return -1; //数组为空
}
long max = a[0];
for(int j = 1; j < nElems; j++) {
if(max < a[j]) {
max = a[j];
}
}
return max;
}
public boolean removeMax() {
if(getMax() == -1) {
return false;
}
return delete(getMax());
}
// end here
} // end class HighArray
////////////////////////////////////////////////////////////////
class HighArrayApp
{
public static void main(String[] args)
{
int maxSize = 100; // array size
HighArray arr; // reference to array
arr = new HighArray(maxSize); // create the array
arr.insert(77); // insert 10 items
arr.insert(99);
arr.insert(44);
arr.insert(55);
arr.insert(22);
arr.insert(88);
arr.insert(11);
arr.insert(00);
arr.insert(66);
arr.insert(33);
arr.display(); // display items
int searchKey = 35; // search for item
if( arr.find(searchKey) )
System.out.println("Found " + searchKey);
else
System.out.println("Can't find " + searchKey);
arr.delete(00); // delete 3 items
arr.delete(55);
arr.delete(99);
arr.display(); // display items again
// start here
System.out.println(arr.getMax());
arr.removeMax();
System.out.println(arr.getMax());
// end here
} // end main()
} // end class HighArrayApp
77 99 44 55 22 88 11 0 66 33
Can't find 35
77 44 22 88 11 66 33
88
77
分享到:
相关推荐
Tarjan-data_structures_and_network_algorithms.pdfTarjan-data_structures_and_network_algorithms.pdfTarjan-data_structures_and_network_algorithms.pdfTarjan-data_structures_and_network_algorithms....
data_structures_and_algorithms_in_java_4th_edition.4630586266.pdf
data_structures_and_algorithms_in_java_4th_edition.4630586266.rar java版本的数据结构
数据结构与算法Java语言描述(第2版)。资源中包含了PDF电子书和完整程序源代码。英文的,但描述简单易懂。 与其它同类书相比,本书的特点:1....特别说明:作者是Robert Lafore。因为存在一本同名的书。
Problem_Solving_in_Data_Structures_&_Algorithms_Using_Python_Programming_Interview_Guide.pdf
数据结构及算法的入门级宝典,java语言描述浅显易懂,可读性很强
Algorithm-python_data_structures_and_algorithms.zip,巨蟒中国,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
Sams_Teach_Yourself_Data_Structures_and_Algorithms_in_24_Hours全英文书籍,pdf版。入门级。
data_structures_algorithms_tutorial
Data Structures and Algorithms in Java (2nd Edition) By Robert Lafore Publisher: Sams Number Of Pages: 800 Publication Date: 2002-11-16 ISBN-10 / ASIN: 0672324539 ISBN-13 / EAN: 9780672324536 ...
Data_structures_and_algorithms_made_easy famouse and popular book in USA
Dictionary_of_Algorithms_Data_Structures_and_Problems
data_structures_and_algorithms_in_java 第4版,英文,带目录
Algorithm-Data_Structures_and_Algorithms_in_Python.zip,由MichaelT.Goodrich,RobertoTamassia和MichaelH.Goldwasser撰写的“Python中的数据结构和算法”的工作解决方案。,算法是为计算机程序高效、彻底地完成...
[Wiley]Data_Structures_And_Algorithms_With_Object-oriented_Design_Patterns_In_C++.zip
Data_structures_algorithms_tutorial
Data Structures and Algorithms in Java - Robert Lafore
Data_Structures_and_Other_Objects_Use_Java原版完整英文教材
Algorithm-Data-Structures-and-Algorithms-in-Java-2nd-Edition-by-Robert-Lafore.zip,Robert Lafore第二版的数据结构与算法,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
Data_Structures_and_Algorithms(包含 pdf 和 源码)