代码搜索:println
找到约 10,000 项符合「println」的源代码
代码结果 10,000
www.eeworm.com/read/182664/9197692
java breakandcontinue.java
// 示范 break 和 continue 语句
public class BreakAndContinue
{
public static void main(String args[ ])
{
for (int i=0;i
www.eeworm.com/read/182664/9197744
java primedemo.java
/* 找1~100之间的素数 */
public class PrimeDemo
{
public static void main(String args[])
{
Outerloop: for(int i=1;i
www.eeworm.com/read/182664/9197778
java choidemo.java
import java.io.*;
public class ChoiDemo
{
public static void main(String args[ ]) throws IOException
{
char c;
System.out.print("Please input a character:");
c
www.eeworm.com/read/182664/9197783
java printdemo.java
public class PrintDemo
{
public static void main(String args[ ])
{
for (int i=1;i0)
{
www.eeworm.com/read/182664/9197843
java invest.java
class Invest
{
public static void main(String[] args)
{
float total = 14000;
System.out.println("Original investment: $" + total);
// Inceases by 40 percent the
www.eeworm.com/read/182664/9197860
java arrangedemo.java
public class ArrangeDemo
{
public static void main(String args[ ])
{ int temp;
int a[ ]={78,23,56,34,12,45,67,89};
for(int n=0;n
www.eeworm.com/read/182664/9197879
java j_capacity.java
// ////////////////////////////////////////////////////////
//
// J_Capacity.java
// ////////////////////////////////////////////////////////
public class J_Capacity
{
public static v
www.eeworm.com/read/182664/9197906
java choicesort.java
public class ChoiceSort
{ public static void main(String args[ ])
{ int i,min;
int str[ ]={2,13,41,58,32};
for(i=0;i
www.eeworm.com/read/182664/9197911
java fibonacci.java
// Fibonacci 数列
// f(0)=1,f(1)=1,f(n)=f(n-1)+f(n-2) 条件:n>=3
public class Fibonacci
{
public static void main(String args[ ])
{
int n;
int f[ ]=new int[15];
www.eeworm.com/read/182566/9199904
java userinterface.java
package Osbert;
import java.io.*;
public class UserInterface {
public static char getChar()
//
// returns a char from the keyboard
//
{
char ch = ' '; // char return value