java£ºËÄÔò»ìºÏÔËË㣬ģÄâ΢ÈíµÄ¼ÆËãÆ÷
package arrays.myArray;
import java.util.Scanner;
public class SortObject {
private static int intercePosition = 0; // ¼Ç¼µ¥¸öÔËËãÊý¾ÝµÄ³¤¶È
private static int[] intercePositionIndex = null; // ¼Ç¼“£¨”µÄϱê
private static int[] intercePositionEnd = null; // ¼Ç¼“£©”µÄϱê
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
do {
System.out.println("ÇëÊäÈëÄãÒª¼ÆËãµÄ×Ö·û´®(×¢Ò⣺ֻÄÜÊäÈëÊý×ֺͼӣ¬¼õ£¬³Ë³ý·ûºÅ;ÊäÈëÍê±Ïºó,ÇëÖ±½Ó»Ø³µ):");
String numberString = input.next().trim();
// ÅжÏÊäÈëµÄÔËËã×Ö·û´®ÊÇ·ñ·ûºÏ¹æ¶¨
if (ispassString(numberString) == false) {
System.out.println("ÄúÊäÈëµÄ¼ÆËã×Ö·û´®ÓÐÎó,ÇëÕýÈ·ÊäÈë!");
} else {
// ¼ÆËã½á¹û·µ»Ø
System.out.println(interceResult(numberString));
}
} while (true);
}
// ÅжÏÊÇ·ñÓдøÀ¨ºÅµÄÔËËã×Ö·û´®´æÔÚ
private static String interceResult(String str) {
String result = str;
char[] numberString = str.toCharArray(); // 1+2+(1*2+1-1*2+5)+2+(1+5+9+10-11)+1*5/2+3
// 1+8-9+(1*8/2-5+(1+2+8))+4/5*8/3*2
int IndexStart = 0; // ¼Ç¼“£¨”µÄʵ¼ÊÊýÁ¿
int EndStart = 0; // ¼Ç¼“£©”µÄʵ¼ÊÊýÁ¿
for (int i = 0; i < numberString.length; i++) {
if ('(' == numberString[i]) {
// ¼Ç¼×îºóÒ»¸öÕýÀ¨ºÅµÄλÖÃ
IndexStart = i;
}
if (')' == numberString[i]) {
// ¼Ç¼·´À¨ºÅµÄ×î³õʼϱêµÄλÖÃ
EndStart = i;
// ½ØÈ¡×îÀïÃæÒ»¸öÀ¨ºÅÀïµÄÔËËã×Ö·û´®
result = result.substring(IndexStart + 1, EndStart);
// ½ØÈ¡À¨ºÅµÄÔËË
Ïà¹ØÎĵµ£º
Ϊʲô˵ÂÒÂëÊÇÖйú³ÌÐòÔ±ÎÞ·¨±ÜÃâµÄ»°ÌâÄØ£¿Õâ¸öÊ×ÏÈÒª´Ó±àÂë»úÖÆÉÏ˵Æð£¬´ó¼Ò¶¼ÊÇÖÐÎĺÍÓ¢ÎĵıàÂë¸ñʽ²»ÊÇÒ»Ñù£¬½âÂëÒ²ÊDz»Ò»ÑùµÄ£¡Èç¹ûÖйúµÄ³ÌÐòÔ±²»»áÓöµ½ÂÒÂ룬ÄÇôֻÓÐʹÓúºÓï±à³Ì¡£ººÓï±à³ÌÊÇÔõô»ØÊÂÎÒÒ²²»´óÇå³þ£¬Ó¦¸ÃÊÇǰÄê°É£¬ÎÒÒ»ÅóÓѸøÎÒ½éÉܺºÓï±à³Ì£¬Ôõô²»´í²»´í£¿µ±Ê±ÒòΪѧϰæûȥ¹Ø×¢Õâ¸ö£¬µÈÎÒÏÐ ......
public class Split{
public static void main(String[] args){
double pai = 3.14159;
findTwo(pai);
public static void findTwo(double value){
System.out.println(new DecimalFormat("0.##"). ......
package arrays.compara;
/**
*
* @author Happy ¶þ·Ö²éÕÒ·¨
*/
public class BinarySearch {
public static void main(String[] args) {
int[] arrInt = { 2, 34, 32, 24, 23, 34, 12, 3, 4, 2 };
int index = bSearch(29, arrInt, 0, arrInt.length);
& ......
package arrays.myArray;
public class BinaryTree {
private Node root;
// Ìí¼ÓÊý¾Ý
public void add(int data) {
// µÝ¹éµ÷ÓÃ
if (null == root)
root = new Node(data, null, null);
else
addTree(root, data);
......