有字串陣列
String a[]={"This", "is", "a", "string", "array"};
請利用Java的LinkedList實作線性串列如下:
["This", "is", "a", "string", "array","array","string","a","is","This"]
提示:請參閱下面程式擷圖
Java的LinkedList與連分數Continued Fraction
herrDeng網內搜尋

自訂搜尋
Ads
訂閱:
張貼留言 (Atom)
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力,本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動,請在活動期間內踴躍上網檢測資訊安全素養認知程度,並有機會參與抽獎,詳情請參閱活動網站(網址: https://isafe.moe.edu.tw/event
-
C++示範bitset取代hashset解Leetcode 1733 Minimum Number of People to Teach C++ STL的unordered_set與bitset都能解這題,但執行效率差很多,有誰寫C++其執行效能要比類似的Python cod...
-
C C++ GCD LCM解Leetcode難題2197 Replace Non Coprime Numbers in Array 用binary Euclidean algorithm定義gcd,然後定義lcm之後就是用stack [Py3 code請進]
-
Py3 C++算術建構解1317 Convert Integer to the Sum of Two No Zero Integers [Py3解請進]
-
C++C py3 log4 prefix sum/bits解Leetcode難題3495 Minimum Operations to Make Array Elements Zero ceil(log4(x)) 可以透過 clz 計算;將 expSum 定義為部分和來計算。 [...
-
C++ C Py3 Rust數bits解Leetcode 2749 Minimum Operations to Make the Integer Zero [Py3解請進]
31 則留言:
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
package kill;
import java.util.*;
public class CAI {
public static void main(String[] args) {
LinkedList<String>list=new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i<a.length; i++)
list.addLast(a[i]);
System.out.println(list);
while (!list.isEmpty()){
System.out.println(list.pop());
}
}
}
public class ket {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class wen {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class san {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1)
linkedList.addLast(a[i]);
for (int j = a.length - 1; j >= 0; j -= 1)
linkedList.addLast(a[j]);
System.out.println(linkedList);
import java.util.*;
public class ex1 {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
import java.util.LinkedList;
public class tt1 {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j--) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
}
}
import java.util.*;
public class aa {
public static void main(String[] args) {
LinkedListlist=new LinkedList();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
public class san {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class ket {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
import java.util.*;
public class LANG {
public static void main(String[] args) {
LinkedListlist=new LinkedList();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
package asd;
import java.util.*;
public class you {
public static void main(String[] args) {
LinkedListlist=new LinkedList();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i<a.length; i++)
list.addLast(a[i]);
System.out.println(list);
while (!list.isEmpty()){
System.out.println(list.pop());
}
}
}
package sws;
import java.util.*;
public class swsw{
public static void main(String[] args) {
LinkedList<String>list=new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i<a.length; i++)
list.addLast(a[i]);
System.out.println(list);
while (!list.isEmpty()){
System.out.println(list.pop());
}
}
}
package kill;
import java.util.*;
public class CAI {
public static void main(String[] args) {
LinkedListlist=new LinkedList();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i<a.length; i++)
list.addLast(a[i]);
System.out.println(list);
while (!list.isEmpty()){
System.out.println(list.pop());
}
}
}
public class ex1 {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class abc {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
LinkedList linkedList = new LinkedList();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
public class B9933137 {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class ak {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
LinkedList<String> linkedList = new LinkedList<String>();
String[] a = {"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int j = a.length - 1; j >= 0; j -= 1) {
linkedList.addLast(a[j]);
}
System.out.println(linkedList);
public class ket {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
import java.util.*;
public class ex1 {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class ket {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
public class ex1 {
public static void main(String[] args) {
LinkedList<String> linkedList = new LinkedList<String>();
String a[]={"This", "is", "a", "string", "array"};
for (int i = 0; i < a.length; i += 1) {
linkedList.addLast(a[i]);
}
for (int k = a.length - 1; k>= 0; k-= 1) {
linkedList.addLast(a[k]);
}
System.out.println(linkedList);
}
}
package kill;
import java.util.*;
public class CAI {
public static void main(String[] args) {
LinkedListlist=new LinkedList();
String a[]={"This", "is", "a", "string", "array","array","string","a","is","This"};
for(int i=0; i<a.length; i++)
list.addLast(a[i]);
System.out.println(list);
while (!list.isEmpty()){
System.out.println(list.pop());
}
}
}
張貼留言