java program to find prime number

/*** Created by WQC on 2017/7/18.* Find the smallest number of rotated arrays* Move a number of elements at the beginning of an array to the end of the array, called the rotation of the array* Enter a rotation of an incrementally sorted array, output the smallest element of the rotated array* For example: 3,4,5,1,2 is a rotation of 1,2,3,4,5, the minimum value is

need to judge the conditions, all inserted can.The code is as follows:1 ImportJava.util.HashMap;2 3 4 Public classHashmap_examp {5 6 Public Static voidMain (string[] args) {7hashmapNewHashmap();8String str= "afashfjgjkhlnmash,^566* integer GSHKJSHGKSDFSGDFHJK";9 for(intI=0;i){Ten CharC=Str.charat (i); OneString key=string.valueof (c); A if(Map.containskey (key)) { -Integer value=Map.get (key); -Map.put (Key, value+1); the } - Else{

Know the number of objects created by static fields and constructorsLau, October 17,2015Package Demo;Class objectnumbers{static int number=0;Public Objectnumbers () {System.out.println ("Already created" + (++number) + "Objects!! ");}}public class Search {public static void Main (string[] args) {Objectnumbers obj1=new objectnumbers ();Objectnumbers obj2=new objec

Instance:ImportJava.util.*;//How many days a year to a certain year Public classtest{ Public Static voidMain (string[] args) {Scanner in=NewScanner (system.in); System.out.println ("===== How many days a year to a certain year ====="); System.out.print ("Please enter the start year:"); intStart = In.nextint ();//gets the start year of user input intrecord = 0;//record the number of times the user entered the end year intEnd//declaration

public static void Main (string[] args) {string strnumbers = "0123456789";//System.out.println used for judging the number ("Please enter a string:"); String string = new Scanner (system.in). Next (); Custom input string[] strings = new String[string.length ()];//Custom is String System.out.println ("Custom length = =" +strings.length);// Loop the custom string and place each character into the array for (int i = 0; i 　　

Problem and code: Problem Description: Enter a number to calculate and output all the mass factors of this number. For example, enter 120, Output 2 2 2 3 5 Program code: public class Exercise4_16 { //Main method public static void Main (String args[]) { Java.util.Scanner input = New Java.util.Scanner (system.in); Prompt the user to enter a positi

use the sort () function, directly using the Arrays.sort () function array of small to large order, each time the results are directly output.At the same time, I need to clear the results after the loop, I use the Arrays.fill () function, with ' "" to fill, but there are insufficient places, will be emptied after the form of 0 exist, the length of the array has not changed, so need me to further improve, the final evaluation results still have a run timeout!! , for informational purposes onlyIn

Method one private static int getnumlenght (long num) { num = num>0?num:-num; return string.valueof (num). Length (); } Method two private static int getnumlenght (long num) { num = num>0?num:-num; if (num==0) { return 1; } return (int) math.log10 (num) +1; } Method three private static int getnumlenght (long num) { if (num==0) { return 1; } int lenght = 0; for (long temp = num; Temp!

Program//Find out e=1+1/1!+1/2!+1/3!+......+1/n!+ ... The approximate value, the request error is less than 0.0001import java.applet.*;import java.awt.*;import java.awt.event.*;p ublic class At1_1 extends Applet Implements Actionlistener{textfield Text1;button button1;public void init () { text1 = new TextField ("0"); button1 = new Button ("purge"); add (Text1); Add (Button1); text1.addactionlistener (this)

1. Write Textrw.java java application, the function of the program is: first write their own number and name to TextRw.txt, read the information in TextRw.txt and display it on the screen. PackageTest03;ImportJava.io.File;ImportJava.io.FileInputStream;Importjava.io.FileNotFoundException;ImportJava.io.FileOutputStream;Importjava.io.IOException; Public classTEXTRW

Import Java.util.scanner;public class Test {public static void main (string[] args) {Scanner sc = new Scanner (system.in); T a =sc.nextint (); int b =sc.nextint (); int c =sc.nextint (); int t=0;if (a>b) {t=a;a=b;b=t;} if (a>c) {t=a;a=c;c=t;} if (b>c) {t=b;b=c;c=t;} System.out.println (b);//Sort and then output the sorted intermediate number B//int zhong= a>b? (AJava programming: Use the three-mesh operator and exchange two methods to

Java program --- converts a floating point number into a Renminbi reading method, java reading Method The Code is as follows:

Import Java.util.scanner;public class Test {public static void main (string[] args) {Scanner sc = new Scanner (system.in); T n = sc.nextint ();//Converts an integer n to a string to find its length int len = integer.tostring (n). Length (); System.out.println ("The length of the string is len=" +len);//Use the while loop to find its length int count = 0;while (true) {count++;n = N/10;if (n==0) break;} Syste

I. Contents of the topicGiven a positive integer in decimal, write down all integers starting with 1, to N, and then count the number of "1" that appears.Requirements:Write a function f (n) that returns the number of "1" that occurs between 1 and N. For example F (12) = 5.Within a 32-bit integer range, the maximum n of the "F (n) =n" that satisfies the condition is what.Second, design ideasEach bit to calcu

Find the number and location of occurrences of a string public class Search { public static void Main (string[] args) { String str = "abc123abcd1234"; String searchstr = "BC"; int count = Getstrcount (STR,SEARCHSTR); System.out.println ("Count is:" + count); } public static int Getstrcount (String str,string searchstr) { int index =0;//define the index

(Bo Master original)First of all, Bo Master is a freshman year end of the winter vacation when I read the Java, and then I look at Head first Java Chinese version, because a freshman learned C, so some of the basic ideas are still understood, Look at this book is a glance (that is, the kind of light to see no self-tapping code), and then see the book of a guess the numb