标签: array-merge

这个数组合并有什么问题？

$array_az = range('a', 'z');
$array_AZ = range('A', 'Z');
$array_09 = range(0, 9);
array_merge($array_az, $array_AZ, $array_09);
print_r($array_az); // a, b, c ... z, 0, 1 ...

但我想要这样的东西:// a,b,c,... z,A,B,C,... Z,0,1 ...

我怎么能得到这个输出？谢谢.

昨天我头疼.

基本上我有一个带有字符串键的数据的关联数组(包含数值,但仍然是引用的字符串)<select>作为选项放在一个框中.我想在占位符值的前面添加一个占位符值.

我试图使用array_merge:

$placeholder = "Month";
$source = array
(
    '01' => '01 - January',
    '02' => '02 - February',
    '03' => '03 - March',
    '04' => '04 - April',
    '05' => '05 - May',
    '06' => '06 - June',
    '07' => '07 - July',
    '08' => '08 - August',
    '09' => '09 - September',
    '10' => '10 - October',
    '11' => '11 - November',
    '12' => '12 - December'
);

$source = array_merge(array('' => $placeholder), $source);

我看到了奇怪的结果 …

我试图将$ _POST值分成不同的数组来检查它的值.我试图将$ key和$值保留为关联数组.现在,只有array_push工作,但不是array_merge.Array_merge为我返回一个空数组.有人可以帮忙吗？

$reg_word = $reg_alpha = $reg_paragraph = array();


foreach ($_POST as $key=>$value){
        if (in_array($key, $alpha_numbers)){    
            array_push($reg_word, $value);
        } else

        if (in_array($key, $alpha)){
            array_push($reg_alpha, $value);
        } else

        if (in_array($key, $paragraph)){
            array_push($reg_paragraph, $value);
        }
    }

显示器

Array ( [0] => St. John [1] => M [2] => kjkjk ) 
Array ( [0] => HKG ) 
Array ( [0] => kjkj )

我想要它显示Array( Location => St. John)等

我正在编写代码来合并2个排序的数组代码如下

void main()
{
    int a[]={7};
    int b[] = {8};
    int ret;
    int *c;
    merge(a,b,c,1,1);
}
void merge(int *a, int *b,int *sorted, int i, int j)
{
    int c1,c2,k=0;
    c1=0;
    c2=0;

    for(k=0;c1<i && c2< j;k++)
    {
        if(a[c1]<b[c2])
            sorted[k]=a[c1++];
        else
            sorted[k]=b[c2++];
    }
    while(c1<i)
        sorted[k++]=a[c1++];
    while(c2<j)
        sorted[k++]=b[j++];
}

运行此代码程序时停止,我得到以下异常

Problem Event Name: APPCRASH
  Application Name: merge.exe
  Application Version:  0.0.0.0
  Application Timestamp:    556fb91c
  Fault Module Name:    merge.exe
  Fault Module Version: 0.0.0.0
  Fault Module Timestamp:   556fb91c
  Exception Code:   c0000005
  Exception Offset: 00001739
  OS Version: …

我想合并多个字节数组但是失败.最后一个数组只显示最后添加的字节数组,而不是所有字节数组.以下是我的尝试.

List<byte[]> d = new List<byte[]>();
foreach (var item in IDs)
{       
    obj = RequisitionsObj.GenerateLabOrderReq();

    if (obj.Data != null)
    {    
        d.Add(obj.Data);              
    }     
}

byte[] final = Combine(d.SelectMany(a => a).ToArray());

private byte[] Combine(params byte[][] arrays)
{
    byte[] rv = new byte[arrays.Sum(a => a.Length)];
    int offset = 0;

    foreach (byte[] array in arrays)
    {
        System.Buffer.BlockCopy(array, 0, rv, offset, array.Length);
        offset += array.Length;
    }

    return rv;
}

我有两个数组

第一个阵列

array(
    [0] => +970
    [1] => +971
    [2] => +972
)

和第二阵列

array(
    [0] => 465465454
    [1] => 321321355
    [2] => 987946546
)

我想像这样合并它们

array(
    [+970] => 465465454
    [+971] => 321321355
    [+972] => 987946546
)

我尝试array_merge但这给了我一些我不想要的结果

$busi_code  = $page1_data->business_code; //array
$busi_num  = $page1_data->business_number; //array

$business_phone_numbers = array_merge($busi_code, $busi_num);

echo '<pre>';
print_r($business_phone_numbers);
echo '</pre>';

结果是

[0] => +970
[1] => +971
[2] => +972
[3] => 465465454
[4] => 321321355
[5] => 987946546

所以请指导我如何达到我要求的结果.

我正在尝试实现mergesort算法,我做了你在下面看到的,但我似乎没有得到正确的结果,请检查我的代码,让我知道我错过了什么.

package test;

public class MergeSort {

  private static void mergesort(int[] arr, int n) {
      int mid;
      int[] left;
      int[] right;
      if(n<2 ){return;}
      mid = n/2;

      left = new int[mid];
      right = new int[n-mid];

      for(int i=0;i<mid;i++){
          left[i]=arr[i];

      }
      for(int i=mid;i<n;i++){
          right[i-mid]=arr[i];

      }

      mergesort(left,mid);
      mergesort(right,n-mid);
      merge(arr,left,mid,right,n-mid);

  }


private static void merge(int[] arr, int[] left, int leftcount, int[] right, int rightcount) {
    // TODO Auto-generated method stub
    int i,j,k;

    i=0;j=0;k=0;

    while(i<leftcount && j<rightcount){
        if(left[i] <right[i]){
            arr[k]=left[i];
            k++;
            i++;
        }
        else{
            arr[k]=right[j];
            k++; …

我有这样的数组:

Array (
    [2018-03-12] => Array (
        [United States] => 4
        [Australia] => 15
        [United Kingdom] => 0
        [New Zealand] => 0
    )
    [2018-03-13] => Array (
        [United States] => 0
        [Australia] => 8
        [United Kingdom] => 2
        [New Zealand] => 0
    )
)

我想制作一个这样的数组:

[
    ["2018-03-12", 4, 15, 0, 0],
    ["2018-03-13", 0, 8, 0, 2]
]

如何才能做到这一点？

我有3个数组，如下所示：

阵列1：

array 1: [
  0 => array[
    "product_id" => "a"
    "quantity_1" => "1"
  ]
  1 => array[
    "product_id" => "b"
    "quantity_1" => "2"
  ]
  2 => array[
    "product_id" => "c"
    "quantity_1" => "1"
  ]
]

阵列2：

array 2: [
  0 => array[
    "product_id" => "a"
    "quantity_2" => "1"
  ]
  1 => array[
    "product_id" => "d"
    "quantity_2" => "2"
  ]
]

我想要的结果是：

array 3: [
  0 => array[
    "product_id" => "a"
    "quantity_1" => "1"
    "quantity_2" => "1"
  ]
  1 => …