arr | 数组增强组件主要是对数组等数据进行处理，如无限级分类操作、商品规格的迪卡尔乘积运算等。 | Math library

When I use the following code to print all subsets of the string "abc", the code works as expected, printing : ab a b

I'm trying to parallelize a merge-sort algorithm. What I'm doing is dividing the input array for each thread, then merging the threads results. The way I'm trying to merge the results is something like this:

I have the following digits:

Let's say I have a list of strings

In my app I want the user to mention how many columns he wants for the table and then enter the data for those columns and create a table with those values. Here is what I have:

I am trying to divide merged information from one cell into separate cells.

one cell:

divided data: (I want to export each part into another cell)

I can't simply divide by finding empty space, status cell which is case-sensitive | status:WBB NAS MRR OWA PXA| has a different data range with spaces that can't be divided.

Split ( expression [,delimiter] [,limit] [,compare] )

I have an array of objects. I want to keep the objects with ID: 0 but remove the duplicates from the array where id > 0.

I have a list [A,B,C,D,E] and a list of indexes [3,2,0,4,1] but the indexes actually points to itself, giving the order to follow.

So starting at 0, next index is 3, then at index 3, the next index is 4,1,2,0 etc.

I can achieve this by looping and updating the index, but my list may have thousands of points, Is there a way to avoid loops and vectorize this?

my code:

I am solving this problem on dynamic array in which input first line contains two space-separated integers,n, the size of arr to create, and q, the number of queries, respectively. Each of the q subsequent lines contains a query string,queries[i]. it expects to return int[]: the results of each type 2 query in the order they are presented.

i tried to attempt as below and my code seems fine to me but it gives segmentation fault error. please help me where I am getting conceptually wrong. thanks.

problem: Declare a 2-dimensional array,arr , of n empty arrays. All arrays are zero indexed. Declare an integer,last answer , and initialize it to zero.

There are 2 types of queries, given as an array of strings for you to parse:

Query: 1 x y

Let idx=((queries[i][1]^last_answer)%n);. Append the integer y to arr[idx].

Query: 2 x y

Let idx=((queries[i][1]^last_answer)%n);. Assign last_answer=arr[idx][queries[i][2]%(arr[idx].size())] . Store the new value of last_answer to an answers array.

input: 2 5

1 0 5

1 1 7

1 0 3

2 1 0

2 1 1

output:

7

3