- MylinkList
- CountStr
实现单链表
package Chap16;
//测试类
public class TestMyList {
public static void main(String[] args) {
MylinkList stringMylinkList = new MylinkList<>();
stringMylinkList.insert(1,"You");
stringMylinkList.insert(1,"Love");
stringMylinkList.insert(1,"I");
stringMylinkList.print();
System.out.println();
MylinkList integerMylinkList = new MylinkList();
integerMylinkList.insert(1,4);
integerMylinkList.insert(1,5);
integerMylinkList.insert(1,7);
integerMylinkList.insert(1,6);
integerMylinkList.delete(2);
System.out.println("长度:"+integerMylinkList.length());
integerMylinkList.print();
}
}
//泛型接口
interface IList{
int length();
void insert(int i ,E e);
void delete(int i);
void print();
}
//实现泛型接口
class MylinkList implements IList {
int size = 0;
public Node head;
private class Node {
private E data;
private Node next;
public Node(E data) {
this.data = data;
}
}
public MylinkList() {
this.head = new Node(null);
}
@Override
public int length() {
return size;
}
@Override
public void insert(int i, E e) {
Node p = head;
for (int j = 0;j q = new Node(e);
q.next = p.next;
p.next = q;
size++;
}
@Override
public void delete(int i) {
Node p = head;
for (int j = 0;j
运行结果
CountStr
import java.util.HashMap;
import java.util.Map;
public class CountStr {
public static void main(String[] args) {
String string = "to be or not to be,that is a question.";
String [] words = string.split("[ ,.]");
Map map = new HashMap<>();
for (String s:words){
if(!map.containsKey(s))
map.put(s,1);
else{
int v = map.get(s);
v++;
map.put(s,v);
}
}
System.out.println(map);
}
}
运行结果:



