java 代码
- 我总结了一下显示数组的方法:
- 迭代方法:
- public static void display(int arrays [] ,int first ,int last){
- while(first<=last){
- System.out.println(arrays[first++];
- }
- }
- 下面是递归方法:
- public static void display(int arrays [] ,int first ,int last){
- System.out.println(arrays[first]);
- if(first<last){
- display(arrays,first+1,last);
- }
- }
- public static void display(int arrays[] ,int first,int last){
- if(first<=last){
- display(arrays,first,last);
- System.out.println(arrays[last]);
- }
- }
- public static void display(int arrays [] ,int first ,int last){
- if(first==last){
- System.out.println(arrays[first]);
- }else {
- int mid = (first+last)/2;
- display(arrays,first,mid);
- display(arrays,mid+1,last);
- }
- }
- public static void display(int arrays [] ,int first ,int last){
- if(first==last){
- System.out.println(arrays[first]);
- }else {
- int mid = (first+last)/2;
- display(arrays,first,mid-1);
- System.out.println(arrays[mid]);
- display(arrays,mid+1,last);
- }
- }
java 代码
- 下面是如何遍历一个链表:
- public static void displayChain(Node nodeone){
- if(nodeone!=null){
- System.out.println(nodeone.data+" ");
- displayChain(nodeone.next);
- }
- }
- 如果想以相反的顺序输出,如果用迭代只遍历N次,所以麻烦。然而可以用递归:
- public static void displayBackChain(node nodeone){
- if(nodeone!=null){
- displayBackChain(nodeone.next);
- System.out.println(nodeone.data);
- }
- }