23 questions
The search function using djangoqueryset is As the amount of data grows, the speed decreases exponentiallyI want to attach django library django-haystack to elasticsearch and use it. Is django-haystac...
This is a programmers stack/queue issue. count = 0 for i in range(len(left_days)): largest = left_days[0] if(largest >= left_days[i]): count += 1 if(i==len(left_days)-1): answer.append(count)...
Hello.I have a question, so I'm posting it like this.I'll explain it with the code first.function a(){ // Function that takes 100-150 ms to spin once. time-consuming at for for(){ // Calculation, cal...
typedef struct stack* Stack;typedef char element;struct stack { element* array; int size; int top;};int IsEmpty(Stack S) { return (S->top<0);}int IsFull(Stack S) { return ((S->top+1) == S->...
package myfirstjava;import java.util.ArrayList;import java.util.Scanner;import java.util.StringTokenizer;class GStack<T> { static int top; Object[] stck; public GStack() { top = 0; stck = new ...
void main(){ int stack[1000]; int top; int n; int num = 0; top = 0; scanf_s(%d, &n);for (int i = 0; i < n;i++) { char word[10]; gets(word); If (strcmp(word, push) == 0) { //push 1, 1 should b...
I think the stack is faster. But she's not a friendin my experienceIt takes different time depending on the situationI didn't do that when I used the stackWhich is faster, stack allocation or heap all...
Hello. I'm implementing a calculator using a stack.If you enter only integers now, the problem is saved to the list as a string. ex) 1+2/3 [1,+,2,/,3]But I'm asking you a question because I'm trying t...
Below is the source code I wrote, and the infixToPostfix function converts the median expression in the main function into a posterior expression, and the evalPostfix function calculates the converted...
#include <stdio.h>#include <stdlib.h>#defineMAX_STACK_SIZE 100 // Declare Global Variableschar stack[MAX_STACK_SIZE];int top = -1; void stackFull() { fprintf(stderr, Stack is full, cannot...
« | - 2 - | » |
© 2024 OneMinuteCode. All rights reserved.