Java 打破循环

欢马劈雪

工程师 (已认证)

原创分享签约作者

发表于实例源码

384

打破循环

实例源码：

源代码：

执行

执行中...

class BreakDemo {

public static void main(String[] args) {

/*
    时   代     Java  公  众  号 - nowjava.com 提 供
    */

int[] arrayOfInts = { 32, 87, 3, 589, 12, 1076, 2000, 8, 622, 127 };

int searchfor = 12;

int i;

boolean foundIt = false;

for (i = 0; i < arrayOfInts.length; i++) {

if (arrayOfInts[i] == searchfor) {

foundIt = true;

break;

}//from 时 代 J a v a 公 众 号 - N o w J a v  a . c o m

}

if (foundIt) {

System.out.println("Found " + searchfor + " at index " + i);

} else {

System.out.println(searchfor + " not in the array");

}

* Redistribution and use in source and binary forms, with or without

* modification, are permitted provided that the following conditions

* are met:

*   - Redistributions of source code must retain the above copyright

*     notice, this list of conditions and the following disclaimer.

*   - Redistributions in binary form must reproduce the above copyright

*     notice, this list of conditions and the following disclaimer in the

*     documentation and/or other materials provided with the distribution.

*   - Neither the name of Oracle or the names of its

*     contributors may be used to endorse or promote products derived

*     from this software without specific prior written permission.

* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

* PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR

* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
/**代码未完, 请加载全部代码(NowJava.com).**/

​x
 
​
class BreakDemo {
​
    public static void main(String[] args) {
​
    /*
    时   代     Java  公  众  号 - nowjava.com 提 供
    */
​
        int[] arrayOfInts = { 32, 87, 3, 589, 12, 1076, 2000, 8, 622, 127 };
​
        int searchfor = 12;
​
​
        int i;
​
        boolean foundIt = false;
​
​
        for (i = 0; i < arrayOfInts.length; i++) {
​
            if (arrayOfInts[i] == searchfor) {
​
                foundIt = true;
​
                break;
​
            }//from 时 代 J a v a 公 众 号 - N o w J a v  a . c o m
​
        }
​
​
        if (foundIt) {
​
            System.out.println("Found " + searchfor + " at index " + i);
​
        } else {
​
            System.out.println(searchfor + " not in the array");
​
        }
​
    }
​
}
​
​
/*
​
 * Copyright (c) 1995, 2008, Oracle and/or its affiliates. All rights reserved.
​
 *
​
 * Redistribution and use in source and binary forms, with or without
​
 * modification, are permitted provided that the following conditions
​
 * are met:
​
 *
​
 *   - Redistributions of source code must retain the above copyright
​
 *     notice, this list of conditions and the following disclaimer.
​
 *
​
 *   - Redistributions in binary form must reproduce the above copyright
​
 *     notice, this list of conditions and the following disclaimer in the
​
 *     documentation and/or other materials provided with the distribution.
​
 *
​
 *   - Neither the name of Oracle or the names of its
​
 *     contributors may be used to endorse or promote products derived
​
 *     from this software without specific prior written permission.
​
 *
​
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
​
 * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
​
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
​
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
​
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
​
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
/**代码未完, 请加载全部代码(NowJava.com).**/