topsort.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 70 行

/*
 * Copyright (C) 2000-2007 Wang Pengcheng <[e-mail]>
 * Licensed to the Wang Pengcheng under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The LGPL licenses this file to You under the GNU Lesser General Public
 * Licence, Version 2.0  (the "License"); you may not use this file except in
 * compliance with the License.  You may obtain a copy of the License at
 *
 *     http://www.gnu.org/licenses/lgpl.txt
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
//3 Dec 2007
package cn.edu.whu.iss.algorithm.unit10.test;

/**
 * 
 * @author wpc
 *
 */
public class Topsort {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String ss, s1, s2;
		int j = 0, nn = 0, n1, n2, fhj = 0;
		String[] fh = { " ", "+", "-", "*", "/" };
		int a;
		ss = "3156+2345";
		for (int i = 1; i < fh.length; i++) {
			a = ss.indexOf(fh[i]);
			if (a > -1) {
				j = a;
				fhj = i;
				break;
			}
		}

		s1 = ss.substring(0, j);
		s2 = ss.substring(j + 1);
		n1 = Integer.parseInt(s1);
		n2 = Integer.parseInt(s2);

		switch (fhj){
		 case 1:nn=n1+n2;break;
		 case 2:nn=n1-n2;break;
		 case 3:nn=n1*n2;break;
		 case 4:nn=n1/n2;break;
		 };
/*		if (fhj == 1)
			nn = n1 + n2;
		if (fhj == 2)
			nn = n1 - n2;
		if (fhj == 3)
			nn = n1 * n2;
		if (fhj == 4)
			nn = n1 / n2;*/
		System.out.println(j);
		System.out.println(n2);
	}

}