代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/114399/6124041
java reverse.java
//reverse.Java
public class reverse
{
public static void main(String args[])
{
StringBuffer sf1=new StringBuffer ("This is the first string"); ;
System.out.println("sf1 ="+sf1.reverse())
www.eeworm.com/read/110455/6164178
jcw reverse.jcw
! ** JCreator Workspace File (C)2000
! ********** DO NOT EDIT *********
VERSION := "1.00"
LABEL := "Reverse"
! Start Project Structure
#[BeginProject]SOURCE := "Reverse.jcp" #[EndProject]
www.eeworm.com/read/110455/6164179
jcp reverse.jcp
! ** JCreator Project File (C)2000
! ********** DO NOT EDIT *********
VERSION := "1.10"
LABEL := "Reverse"
JDKPROFILE := ""
ACTIVE := "1"
OUTPUTPATH := "classes"
COMPILER := ""
! Start Run
www.eeworm.com/read/110455/6164181
java reverse.java
import java.io.*;
public class Reverse
{
public static void main(String args[])
{ int i,n =10;
int a[] = new int[10];
for (i=0;i
www.eeworm.com/read/103629/6213776
java reverse.java
//【代码19-1-4】
// Reverse.java
import java.io.*;
import java.net.*;
public class Reverse
{
public static void main(String[] args) throws Exception
{
if (args.length != 1) {
System.e
www.eeworm.com/read/102423/6232413
c reverse.c
void reverse(iorder,ncity,n)
int iorder[],n[],ncity;
{
int nn,j,k,l,itmp;
nn=(1+((n[2]-n[1]+ncity) % ncity))/2;
for (j=1;j
www.eeworm.com/read/102423/6233025
c reverse.c
void reverse(int iorder[], int ncity, int n[])
{
int nn,j,k,l,itmp;
nn=(1+((n[2]-n[1]+ncity) % ncity))/2;
for (j=1;j
www.eeworm.com/read/102267/6234168
java reverse.java
/*
* Copyright (c) 2000 David Flanagan. All rights reserved.
* This code is from the book Java Examples in a Nutshell, 2nd Edition.
* It is provided AS-IS, WITHOUT ANY WARRANTY either expressed or
www.eeworm.com/read/226955/6336658