Skip to content

Commit c7ad1b4

Browse files
committed
run nomorall
1 parent 2179193 commit c7ad1b4

File tree

105 files changed

+3435
-10
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

105 files changed

+3435
-10
lines changed

.metadata/.log

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
!SESSION 2017-09-22 08:55:35.618 -----------------------------------------------
2+
eclipse.buildId=debbuild
3+
java.version=1.7.0_131
4+
java.vendor=Oracle Corporation
5+
BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=zh_CN
6+
Command-line arguments: -os linux -ws gtk -arch x86_64
7+
8+
!ENTRY org.eclipse.jdt.ui 4 10001 2017-09-22 10:30:28.510
9+
!MESSAGE Internal Error
10+
!STACK 1
11+
Java Model Exception: Java Model Status [Timed out while retrieving the attached javadoc for Scanner [in Scanner.class [in java.util [in /usr/lib/jvm/java-7-openjdk-amd64/jre/lib/rt.jar]]] ]
12+
at org.eclipse.jdt.internal.core.JavaElement.getURLContents(JavaElement.java:808)
13+
at org.eclipse.jdt.internal.core.BinaryType.getJavadocContents(BinaryType.java:1037)
14+
at org.eclipse.jdt.internal.core.BinaryMethod.getAttachedJavadoc(BinaryMethod.java:639)
15+
at org.eclipse.jdt.internal.ui.text.javadoc.JavadocContentAccess2.getHTMLContent(JavadocContentAccess2.java:463)
16+
at org.eclipse.jdt.internal.ui.text.java.ProposalInfo.extractJavadoc(ProposalInfo.java:95)
17+
at org.eclipse.jdt.internal.ui.text.java.ProposalInfo.computeInfo(ProposalInfo.java:75)
18+
at org.eclipse.jdt.internal.ui.text.java.ProposalInfo.getInfo(ProposalInfo.java:58)
19+
at org.eclipse.jdt.internal.ui.text.java.AbstractJavaCompletionProposal.getAdditionalProposalInfo(AbstractJavaCompletionProposal.java:555)
20+
at org.eclipse.jface.text.contentassist.AdditionalInfoController$3.run(AdditionalInfoController.java:106)
21+
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:54)
22+
!SUBENTRY 1 org.eclipse.jdt.core 4 1012 2017-09-22 10:30:28.513
23+
!MESSAGE Timed out while retrieving the attached javadoc for Scanner [in Scanner.class [in java.util [in /usr/lib/jvm/java-7-openjdk-amd64/jre/lib/rt.jar]]]
Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
package class1;
2+
3+
import class1.LinkedList.Node;
4+
5+
public class TestClass {
6+
public static void main(String[] args) {
7+
LinkedList ll=new LinkedList();
8+
ll.insert(5);
9+
ll.insert(9);
10+
11+
Node node=ll.first;
12+
int i=getLength(node);
13+
System.out.println(i);
14+
15+
print(node);
16+
}
17+
public static int getLength(Node node){
18+
int length=0;
19+
while(node!=null){
20+
node=node.next;
21+
length++;
22+
}
23+
return length;
24+
}
25+
public static void print(Node node){ //给一个头节点
26+
while(node!=null){
27+
System.out.println(node.info);
28+
node=node.next;
29+
}
30+
}
31+
}
Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
package class1;
2+
3+
public class LinkedList {
4+
public Node first,newNode,last=null; //创建三个节点,头节点,新节点,尾节点
5+
class Node{
6+
Node node;
7+
int info;
8+
}
9+
10+
public Node insert(Node head){
11+
Node newNode=new Node();
12+
newNode.key=key;
13+
last.next=newNode;
14+
newNode=last;
15+
return last;
16+
}
17+
}
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
package class1;
2+
3+
import class1.LinkedList.Node;
4+
5+
public class TestClass {
6+
public static void main(String[] args) {
7+
LinkedList ll=new LinkedList();
8+
ll.insert(5);
9+
ll.insert(9);
10+
11+
Node node=ll.first;
12+
int i=ll.getLength(node);
13+
System.out.println(i);
14+
15+
ll.print(node);
16+
}
17+
18+
19+
}
Lines changed: 79 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,79 @@
1+
package class1;
2+
3+
import java.io.File;
4+
import java.io.FileInputStream;
5+
import java.io.FileNotFoundException;
6+
import java.io.InputStream;
7+
import java.io.InputStreamReader;
8+
import java.util.Scanner;
9+
10+
11+
public class LinkedList {
12+
public Node first,newNode,last=null; //创建三个节点,头节点,新节点,尾节点
13+
public int count;
14+
class Node{
15+
Node link;
16+
int info;
17+
}
18+
public Node createLinked() throws FileNotFoundException{
19+
int num=0;
20+
String inputline;
21+
Class clazz=this.getClass();
22+
InputStream ins=clazz.getResourceAsStream("data.txt");
23+
Scanner scanner=new Scanner(ins);
24+
// Scanner scanner=new Scanner(System.in); //Scanner录入从控制台数据,也可以从各种其它地方录入。比如InputStream in等。
25+
while(true){
26+
// inputline=scanner.toString();
27+
// num=Integer.parseInt(inputline);
28+
String s=scanner.nextLine();
29+
System.out.println(s);
30+
Scanner oneLine=new Scanner(s);
31+
while(oneLine.hasNext()){
32+
String s1=oneLine.next();
33+
num=Integer.parseInt(s1);
34+
if(num==999)
35+
36+
break;
37+
newNode=new Node();
38+
newNode.info=num;
39+
newNode.link=null;
40+
if(first ==null){
41+
first=newNode;
42+
last=newNode;
43+
}else{
44+
last.link=newNode;
45+
last=newNode;
46+
}
47+
}
48+
49+
}
50+
51+
}
52+
public void insert(int i){ //插入链表数据,可以用这个方法来创建链表,也可以读入数据来创建。
53+
Node newNode=new Node();
54+
newNode.info=i;
55+
newNode.link=null;
56+
if(first==null){
57+
first=newNode;
58+
last=newNode;
59+
}else{
60+
last.link=newNode;
61+
last=newNode;
62+
}
63+
count++;
64+
}
65+
public void print(Node node){ //给一个头节点,打印链表
66+
while(node!=null){
67+
System.out.println(node.info);
68+
node=node.link;
69+
}
70+
}
71+
public static int getLength(Node node){ //获取链表长度
72+
int length=0;
73+
while(node!=null){
74+
node=node.link;
75+
length++;
76+
}
77+
return length;
78+
}
79+
}
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
package class1;
2+
3+
import class1.LinkedList.Node;
4+
5+
public class TestClass {
6+
public static void main(String[] args) {
7+
LinkedList ll=new LinkedList();
8+
ll.insert(5);
9+
ll.insert(9);
10+
}
11+
public static print(Node ll){
12+
while(ll.head!=null){
13+
System.out.println(ll.key);
14+
if(ll.next!=null){
15+
ll=ll.next;
16+
}
17+
18+
}
19+
}
20+
}
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
4
2+
5
3+
6
4+
7
5+
8
6+
9
7+
7
8+
888
9+
9
10+
999
Lines changed: 64 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,64 @@
1+
package class1;
2+
3+
import java.io.InputStreamReader;
4+
import java.util.Scanner;
5+
6+
public class LinkedList {
7+
public Node first,newNode,last=null; //创建三个节点,头节点,新节点,尾节点
8+
public int count;
9+
class Node{
10+
Node link;
11+
int info;
12+
}
13+
public Node createLinked(){
14+
int num=0;
15+
String inputline;
16+
Scanner scanner=new Scanner(new InputStreamReader(System.in));
17+
while(true){
18+
inputline=scanner.toString();
19+
num=Integer.parseInt(inputline);
20+
if(num==999)
21+
break;
22+
newNode=new Node();
23+
newNode.info=num;
24+
newNode.link=null;
25+
if(first ==null){
26+
first=newNode;
27+
last=newNode;
28+
}else{
29+
last.link=newNode;
30+
last=newNode;
31+
}
32+
}
33+
34+
Node newNode=new Node();
35+
return first;
36+
}
37+
public void insert(int i){ //插入链表数据,可以用这个方法来创建链表,也可以读入数据来创建。
38+
Node newNode=new Node();
39+
newNode.info=i;
40+
newNode.link=null;
41+
if(first==null){
42+
first=newNode;
43+
last=newNode;
44+
}else{
45+
last.link=newNode;
46+
last=newNode;
47+
}
48+
count++;
49+
}
50+
public void print(Node node){ //给一个头节点,打印链表
51+
while(node!=null){
52+
System.out.println(node.info);
53+
node=node.link;
54+
}
55+
}
56+
public static int getLength(Node node){ //获取链表长度
57+
int length=0;
58+
while(node!=null){
59+
node=node.link;
60+
length++;
61+
}
62+
return length;
63+
}
64+
}
Lines changed: 76 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,76 @@
1+
package class1;
2+
3+
import java.io.File;
4+
import java.io.FileInputStream;
5+
import java.io.FileNotFoundException;
6+
import java.io.InputStream;
7+
import java.io.InputStreamReader;
8+
import java.util.Scanner;
9+
10+
11+
public class LinkedList {
12+
public Node first,newNode,last=null; //创建三个节点,头节点,新节点,尾节点
13+
public int count;
14+
class Node{
15+
Node link;
16+
int info;
17+
}
18+
public Node createLinked() throws FileNotFoundException{
19+
int num=0;
20+
String inputline;
21+
Class clazz=this.getClass();
22+
InputStream ins=clazz.getResourceAsStream("data.txt");
23+
Scanner scanner=new Scanner(ins);
24+
// Scanner scanner=new Scanner(System.in); //Scanner录入从控制台数据,也可以从各种其它地方录入。比如InputStream in等。
25+
while(true){
26+
// inputline=scanner.toString();
27+
// num=Integer.parseInt(inputline);
28+
String s=scanner.nextLine();
29+
Scanner oneLine=new Scanner(s);
30+
while(oneLine.hasNext()){
31+
String s1=oneLine.next();
32+
num=Integer.parseInt(s1);
33+
if(num==999)
34+
break;
35+
newNode=new Node();
36+
newNode.info=num;
37+
newNode.link=null;
38+
if(first ==null){
39+
first=newNode;
40+
last=newNode;
41+
}else{
42+
last.link=newNode;
43+
last=newNode;
44+
}
45+
}
46+
47+
}
48+
}
49+
public void insert(int i){ //插入链表数据,可以用这个方法来创建链表,也可以读入数据来创建。
50+
Node newNode=new Node();
51+
newNode.info=i;
52+
newNode.link=null;
53+
if(first==null){
54+
first=newNode;
55+
last=newNode;
56+
}else{
57+
last.link=newNode;
58+
last=newNode;
59+
}
60+
count++;
61+
}
62+
public void print(Node node){ //给一个头节点,打印链表
63+
while(node!=null){
64+
System.out.println(node.info);
65+
node=node.link;
66+
}
67+
}
68+
public static int getLength(Node node){ //获取链表长度
69+
int length=0;
70+
while(node!=null){
71+
node=node.link;
72+
length++;
73+
}
74+
return length;
75+
}
76+
}
Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
package class1;
2+
3+
import class1.LinkedList.Node;
4+
5+
public class TestClass {
6+
public static void main(String[] args) {
7+
LinkedList ll=new LinkedList();
8+
ll.insert(5);
9+
ll.insert(9);
10+
11+
Node node=ll.first;
12+
getLength(node);
13+
//print(node);
14+
}
15+
public static int getLength(Node node){
16+
int length=0;
17+
while(node!=null){
18+
node=node.next;
19+
length++;
20+
}
21+
return length;
22+
}
23+
public static void print(Node ll){ //给一个头节点
24+
while(ll!=null){
25+
System.out.println(ll.info);
26+
if(ll.next!=null){
27+
ll=ll.next;
28+
}
29+
}
30+
}
31+
}

0 commit comments

Comments
 (0)