网站大量收购独家精品文档,联系QQ:2885784924

数据结构chapter1.ppt

  1. 1、本文档共96页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chapter 1 4. 本书中 5.12 Exercises 2 Write a recursive method that calculates and returns the length of a linked list. 5. 本书中 5.12 Exercises 15 Check recursively if the following objects are palindromes: a. A word b. a sentence ( ignoring blanks, lower- and uppercase differences, and punctuation marks so that “Madam, I’m Adam” is accepted as a palindrome) Chapter 1 实习题: 1. 找出从自然数 1, 2, …, n 中任取r个数的所有组合, 编一个递归算法. 例子: n = 5 1 2 3 4 5 r = 3 5 4 3 5 4 2 5 4 1 5 3 2 5 3 1 5 2 1 4 3 2 4 3 1 4 2 1 3 2 1 2. 实现Hanoi塔 Generic Objects in Java Comparable findMax ( Comparable [ ] a ) { Comparable maxValue = a[ 0 ]; for ( int i = 1; i a.length; i++ ) if ( maxValue.lessThan ( a[i] ) ) maxValue = a[i]; return maxValue; } a generic findMax algorithm. Notice that the objects that are manipulated are not Object, But instead are Comparable. Generic Objects in Java Comparable is an interface. In java, an interface declares a set of methods that must be implemented. In this example, any class that is Comparable must provide an implementation of lessThan A class that is Comparable must also declare so by using the implements clause. public interface Comparable { int lessThan( Comparable rhs ); } compareTo Generic Objects in Java Comparable findMax ( Comparable [ ] a ) { Comparable maxValue = a[ 0 ]; for ( int i = 1; i a.length; i++ ) if ( maxVpareTo(a[i])0 ) maxValue = a[i];

文档评论(0)

好文精选 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档