PrintTest &&ｍergeTest

1import java.util.Random;
2
3/**
4 * Created by Administrator on 2017/9/16.
5 */
6public class PrintTest {
7
8
9    static int M,N;
10    static int MN[][] ;
11
12    public void print(int startX,int startY){
13
14        int col = startY ;
15        int row = startX;
16
17        int rowLength = M - (startY)*2;
18        int colLength = N - (startX)*2;
19
20        for(int i= col;i<N-startX;i++){
21            System.out.print(MN[row][i]+" ");
22            col =i;
23        }
24        row ++ ;
25
26        if(rowLength ==1){
27            return;
28        }
29
30        for(int i= row ;i<M-startY;i++){
31            System.out.print(MN[i][col]+" ");
32            row = i;
33        }
34        col--;
35
36        if(colLength ==1){
37            return;
38        }
39
40        for (int i = col; i >= startY; i--) {
41            System.out.print(MN[row][i] + " ");
42            col = i;
43        }
44        row--;
45
46        for(int i= row ;i>startX;i--){
47            System.out.print(MN[i][col]+" ");
48            row = i;
49        }
50        col ++;
51
52        if(rowLength >2 && colLength >2){ //数组已不可再分解
53            print(row,col);
54        }
55    }
56
57    public void start() {
58        print(0,0);
59    }
60
61    public void ready(){
62        if(M < 1 || N <1)
63            return;
64
65        MN = new int[M][N];
66        Random random = new Random();
67        for(int i=0;i<M;i++){
68          for(int j=0;j<N;j++){
69                int value = random.nextInt(10);
70                MN[i][j] = value;
71                System.out.print(value+" ");
72          }
73          System.out.println("");
74        }
75
76        System.out.println("print:");
77        start();
78        System.out.println("");
79        System.out.println("--------------------------");
80
81    }
82
83    public static  void main(String args[]){
84        PrintTest test =  new PrintTest();
85        PrintTest.M = 5;
86        PrintTest.N = 1;
87        test.ready();
88
89        PrintTest.M = 1;
90        PrintTest.N = 5;
91        test.ready();
92
93        PrintTest.M = 2;
94        PrintTest.N = 5;
95        test.ready();
96
97        PrintTest.M = 5;
98        PrintTest.N = 2;
99        test.ready();
100
101        PrintTest.M = 3;
102        PrintTest.N = 3;
103        test.ready();
104
105        PrintTest.M = 6;
106        PrintTest.N = 6;
107        test.ready();
108
109
110        PrintTest.M = 3;
111        PrintTest.N = 6;
112        test.ready();
113
114    }
115}
116
117
118
119
120
121import java.util.Arrays;
122import java.util.Random;
123
124/**
125 * Created by Administrator on 2017/9/16.
126 */
127public class MergeTest {
128
129    static class  Node{
130        public Node next;
131        public int value;
132        Node(int v){
133            this.value = v;
134        }
135    }
136
137     Node mergeLink;//new sort  link
138     Node currentNode; //link current
139
140
141     Node generate(int length){
142        Random random = new Random();
143        Node[] nodes = new Node[length];
144        for(int i= 0;i < nodes.length;i++) {
145            nodes[i] = new Node(random.nextInt(20));
146        }
147        Arrays.sort(nodes,(o1,o2)-> o1.value - o2.value);
148
149        for(int i= 0;i < nodes.length-1;i++){
150            Node currentNode = nodes[i];
151            Node nextNode = nodes[i+1];
152            currentNode.next = nextNode;
153        }
154        return nodes[0];
155    }
156
157     void sortedMerge(Node nodeA,Node nodeB){
158        while (nodeA != null && nodeB != null){
159            while (nodeB != null){
160                Node nextNode ;
161                boolean isNextA = false;
162                if(nodeA.value > nodeB.value){ //A > B
163                    nextNode = new Node(nodeB.value);
164                    nodeB = nodeB.next;
165                }else{ //A <=B
166                    nextNode = new Node(nodeA.value);
167                    nodeA = nodeA.next;
168                    isNextA = true;
169                }
170                appendLink(nextNode);
171                if(isNextA){
172                    break;
173                }
174            }
175        }
176
177        if(nodeA != null){
178            appendLink(nodeA);
179        }
180
181        if(nodeB != null){
182            appendLink(nodeB);
183        }
184
185
186    }
187
188      void appendLink(Node nextNode){
189        if(mergeLink == null){
190            mergeLink = nextNode;
191        }else if(mergeLink.next == null){
192            currentNode = nextNode;
193            mergeLink.next = currentNode;
194        } else {
195            currentNode.next = nextNode;
196            currentNode = nextNode;
197        }
198    }
199
200    public static  void main(String args[]){
201        MergeTest test = new MergeTest();
202        Node nodeA = test.generate(7);
203        Node nodeB = test.generate(7);
204        print("nodeA",nodeA);
205        print("nodeB",nodeB);
206        test.sortedMerge(nodeA,nodeB);
207        print("mergeNode",test.mergeLink);
208    }
209
210     static  void print(String tip,Node node){
211        System.out.print(tip+":");
212         int size = 0;
213        while (node != null){
214            System.out.print(node.value+" ");
215            node = node.next;
216            size++;
217        }
218        System.out.println(" size :"+size);
219    }
220}