水题练手POJ2255

POJ2255

提交总是RE，留个坑，等AC后填上。

----------------------------------------

找到了之前RE的问题：java太坑爹了，用Scanner.hasNext()居然会把回车也吃掉。后来改成hasNextLine()，可是出现的竟然是WA。这这这。。。

出现WA的代码如下，如果您发现问题了，请多指教，谢谢~~

import java.util.Scanner;

public class _2255 {

static String pre, in;
static char[] post = new char[100];
static int len;

public static void solve(int p1, int p2, int m1, int m2) {
if (p1 > p2)
return;
int i;
for (i = m1; i <= m2; i++) {
if(in.charAt(i)==pre.charAt(p1))
break;
        }    
        post[--len] = pre.charAt(p1);
if (p1 == p2)
return;
        solve(p1 + (i + 1) - m1, p2, i + 1, m2);//right
        solve(p1 + 1, p1 + i - m1, m1, i - 1);//left
    }

public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
while (sc.hasNextLine()) {
            String line = sc.nextLine();
if(line.equals(""))break;
            String[] tokens = line.split(" ");
            pre = tokens[0];
            in = tokens[1];
            len = pre.length();
            post[len]='\0';
            solve(0, len - 1, 0, len - 1);
            System.out.println(post);
        }
    }
}

只好用给出的答案了。悲剧。

import java.util.Scanner;

public class Main {

private static char[] seq = new char[100];
private static int s = -1;

public static void getPostOrder(String pre, String in) {
if (pre.length() == 1 && in.length() == 1) {
            seq[++s] = in.charAt(0);
// seq[++s] = pre.charAt(0);
            return;
        }

char root = pre.charAt(0);
        seq[++s] = root;

int rootIndex = in.indexOf(root);
if (rootIndex == 0) {
            getPostOrder(pre.substring(1), in.substring(1));
return;
        } else if (rootIndex == in.length() - 1) {
            getPostOrder(pre.substring(1), in.substring(0, in.length() - 1));
return;
        } else {
            String in_Left = in.substring(0, rootIndex);
            String in_Right = in.substring(rootIndex + 1);

int indexLeft = -1;
for (int i = 0; i < in_Left.length(); i++) {
int temp = pre.indexOf(in_Left.charAt(i));
if (temp > indexLeft)
                    indexLeft = temp;
            }

if (in_Right.length() == 1) {
                seq[++s] = in_Right.charAt(0);
// return;
            } else {
                String pre_Right = null;
                pre_Right = pre.substring(indexLeft + 1);
                getPostOrder(pre_Right, in_Right);
            }

if (in_Left.length() == 1) {
                seq[++s] = in_Left.charAt(0);
return;
            } else {
                String pre_Left = null;
                pre_Left = pre.substring(1, indexLeft + 1);
                getPostOrder(pre_Left, in_Left);
            }

        }

    }

public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

while (sc.hasNext()) {
            s = -1;

            String pre = sc.next();
            String in = sc.next();

            seq = new char[pre.length() + 1];
            getPostOrder(pre.trim(), in.trim());

while (s >= 0) {
                System.out.print(seq[s--]);
            }
            System.out.println();
        }
    }

}

转载于:https://www.cnblogs.com/leftcopy/archive/2012/03/10/2389535.html