224 questions
Purpose: I want to create a 2D dynamic jug arrayI want to expand only the second dimension laterWe decided to declare a one-dimensional array in variant form and store it in it again.I tried three met...
I would like to delete [[23][01][01]] which is the opposite combination of [[01][23]] in Python's three-dimensional ndarray array as shown below.import numpy as nparr1 = np.array([[0,1], [2,3]], [[...
const createNum=(maxNum)=>{constary_result=[];for (let index=1; index<maxNum;index++){ aary_result.push(index); if(index===maxNum){ returnary_result; }}};console.log(createNum(100));// result//...
The size of the array is determined at compile time, so to declare an array of dynamic sizes int size;scanf(%d, &size);int* arr = (int*)malloc(sizeof(int) * size); I was taught to do this, but eve...
It's exactly the same as the title.For example, PHP can declare and initialize variables simultaneously as follows:$arr=[ arr1 = > [ val1, val2, val3 ], arr2 = > [ val4, val5 ], arr3 = > [ va...
A1 = [[6,-8,11], [7,10,12],[12,14,7],[-5, 9, 4],[5, 7, 8],[3, 13, -2],[11, 8, 9],[3, 5, 4]]I'd like to add the sum of the first and third values after this[[6, -8, 11, 17],[7, 10, 12, 19],[12, 14, 7, ...
JavaScript objects cannot be sorted and reversed.If you are familiar with it, please let me know.There is a function that returns the following objects, and I would like to reverse them in descending ...
There is an application currently under development at Ravel, and I would like to treat nested data as a single array, but I am having a hard time because I do not know how to do it.The forms we want ...
What is the most efficient way to estimate the similarity between n arrays?For example, array1=['aaa', 'bbb', 'ccc', 'dd']array2 = ['bbb', 'ccc']array3 = ['aaa', 'ccc', 'ddd', 'eee']array4 = ['aaa', '...
If there is an array similar to the following, containments=[ { 'id' : 1, 'category' : -1, 'question' : -1, 'answer' : -1} , { 'id' : 2, 'category' : -1, 'question' : 0, 'answer' : -1} , { 'id': 3, 'c...
| - 1 - | » |
© 2025 OneMinuteCode. All rights reserved.