55 questions
This is the code related to the securities company API written by someone else. After passing the value to BlockRequest() in the middle, it receives data from the securities company server through the...
You want to split four elements into a list that stores only integers.Right now, it's just i+1, i+2,... Is there any other way?It hasn't been long since I came over from C, so I keep coming up with th...
I tried to get the number of votes, use the repetitive sentence, use the number of votes, put the symbols i, put the letters on the list, show the voting list, ask what your choice is, and show you wh...
for (Type type : types) { for (Type t : types2) { if (some condition) { // // Do something and break... break; // Breaks out of the inner loop } } }What do I do if I want to completely bre...
Python - Dynamically generate variables using repetitive statements I'm a self-taught Python student I want to make a multiplication gameIf you print out a question for one minute, you will write down...
import turtlescreen=turtle.Screen()image1=D:\\ball.gifscreen.addshape(image1)ball=turtle.Turtle()ball.shape(image1)ball.pensize(0)ball.penup()ball.goto(0, 0)ball.left(90)def go_left(): b1 = 0 ball.l...
Is there a good way to check if the list is null when going around for loop in Java?if (someList != null) { for (Object object : someList) { // // do whatever }}//I if (someList == null) { return; //...
I'm learning based on Python 2! (I don't know why I'm learning it the old way.)The code I made for this problem is as below, but I don't know what's wrongPlease give strength to Python beginners!
std::map< std::string, std::map<std::string, std::string> >My brother m[name1][value1] = data1;m[name1][value2] = data2;m[name2][value1] = data1;m[name2][value2] = data2;m[name3][value1] =...
for(String s : stringArray) { doSomethingWith(s);}How do I know how many times I repeat this if I have this for-each syntax?for(inti=0;i<boundary;i++) The value of i is the number of iterations In ...
« | - 3 - | » |
© 2024 OneMinuteCode. All rights reserved.