public class MyLinkedList {
size;
head;
tail;
MyLinkedList() {
0;
null;
null;
addElement(A inNode) {
null) {
= new Node
{
new Node(inNode);
tail.next;
size++;
updateElement(int index, A content) {
< 0 || index >= size) {
return;
curNode = head;
> 0) {
curNode.next;
index--;
curNode.content = content;
getElement(int index) {
< 0 || index >= size) {
null;
curNode = head;
> 0) {
curNode.next;
index--;
curNode.content;
deleteElement(int index) {
< 0 || index >= size) {
return;
0) {
head.next;
1) {
null;
size--;
return;
preNode = null;
curNode = head;
> 0) {
curNode;
curNode.next;
index--;
= curNode.next;
(size - 1)) {
preNode;
size--;
deleteElement(A deleNode) {
这里可以用来报异常
0) {
return;
(head.content.equals(deleNode)) {
head.next;
1) {
null;