将String添加到String数组的开头

Ana*_*d B 30 java

是否可以在不迭代整个数组的情况下将字符串添加到String数组的开头.

Pet*_*rey 21

唯一的方法是维护一个环形缓冲区.即你有一个计数器,它记住了开始的位置,你移动它而不是移动数组中的所有条目.这只能起作用,因为你重新定义了"开始"的含义.

请参阅ArrayDeque的源代码,其中包含三个字段

   86       /**
   87        * The array in which the elements of the deque are stored.
   88        * The capacity of the deque is the length of this array, which is
   89        * always a power of two. The array is never allowed to become
   90        * full, except transiently within an addX method where it is
   91        * resized (see doubleCapacity) immediately upon becoming full,
   92        * thus avoiding head and tail wrapping around to equal each
   93        * other.  We also guarantee that all array cells not holding
   94        * deque elements are always null.
   95        */
   96       private transient E[] elements;
   97   
   98       /**
   99        * The index of the element at the head of the deque (which is the
  100        * element that would be removed by remove() or pop()); or an
  101        * arbitrary number equal to tail if the deque is empty.
  102        */
  103       private transient int head;
  104   
  105       /**
  106        * The index at which the next element would be added to the tail
  107        * of the deque (via addLast(E), add(E), or push(E)).
  108        */
  109       private transient int tail;
Run Code Online (Sandbox Code Playgroud)

所以添加到开始就像这样

  224       public void addFirst(E e) {
  225           if (e == null)
  226               throw new NullPointerException();
  227           elements[head = (head - 1) & (elements.length - 1)] = e;
  228           if (head == tail)
  229               doubleCapacity();
  230       }


  312       /**
  313        * @throws NoSuchElementException {@inheritDoc}
  314        */
  315       public E getFirst() {
  316           E x = elements[head];
  317           if (x == null)
  318               throw new NoSuchElementException();
  319           return x;
  320       }
Run Code Online (Sandbox Code Playgroud)

注意:它移动头部而不是将所有元素向下移动到阵列中.


Evg*_*eev 13

尝试

    String[] a = {"1", "2"};
    String[] a2 = new String[a.length + 1];
    a2[0] = "0";
    System.arraycopy(a, 0, a2, 1, a.length);
Run Code Online (Sandbox Code Playgroud)

  • -1这当然会迭代数组中的所有元素. (13认同)
  • @PeterLawrey,如果不复制所有以下元素,您就无法在数组前面添加一个值,因此答案是最佳的,不值得-1。 (2认同)

Jon*_*sen 10

如果您已经在使用Guava,可以使用它ObjectArrays::concat来执行此操作:

String[] args = ...;
ObjectArrays.concat("prepended", args);
Run Code Online (Sandbox Code Playgroud)


Dan*_*lev 5

这是@matteosilv提出的解决方案的更正版本:

String[] myArray= {"hi","hi2"};
List<String> list = new LinkedList<String>(Arrays.asList(myArray));
list.add(0, "h3");
myArray = list.toArray(new String[list.size()]);
Run Code Online (Sandbox Code Playgroud)