반응형
+---head
| +-----tail
| | ----------------------------------------
| +-----tail----> /
| ^ /
| \ v↙
| hello
+-----
─ㅁ → ↗ → ↑ ↘↙
ㅂ한자 ├────-----─
ㅂㄴㅇㄹㅈㅈㄷ↑
lain text
# Python3 program to implement direct index
# python
#include <iostream>
// c++
// Java program to implement direct index
// java
# Python3 program to implement direct index
// javascript
#include <iostream>
// kotlin
#include <iostream>
// c
#include <iostream>
// csharp cs
plain text
가나다라마바사아int x = 10;자차카타파하가나다라마바사 int x = 10; 아자차카타파하
#include <iostream>
#include <thread>
void hello() {
std::cout << "Hello Concurrent World\n";
}
int main() {
std::thread t(hello);
t.join();
}
# Python3 program to implement direct index
# mapping with negative values allowed. mapping with negative values allowed. mapping with negative values allowed. mapping with negative values allowed. mapping with negative values allowed.
# Searching if X is Present in the
# given array or not.
def search(X):
if X >= 0:
return has[X][0] == 1
# if X is negative take the absolute
# value of X.
X = abs(X)
return has[X][1] == 1
def insert(a, n):
for i in range(0, n):
if a[i] >= 0:
has[a[i]][0] = 1
else:
has[abs(a[i])][1] = 1
# Driver code
if __name__ == "__main__":
a = [-1, 9, -5, -8, -5, -2]
n = len(a)
MAX = 1000
# Since array is global, it is
# initialized as 0.
has = [[0 for i in range(2)]
for j in range(MAX + 1)]
insert(a, n)
X = -5
if search(X) == True:
print("Present")
else:
print("Not Present")
# This code is contributed by Rituraj Jain
// Java program to implement direct index
// mapping with negative values allowed.
class GFG
{
#abc
final static int MAX = 1000;
// Since array is global, it
// is initialized as 0.
static boolean[][] has = new boolean[MAX + 1][2];
// searching if X is Present in
// the given array or not.
static boolean search(int X)
{
if (X >= 0)
{
if (has[X][0] == true)
{
return true;
}
else
{
return false;
}
}
// if X is negative take the
// absolute value of X.
X = Math.abs(X);
if (has[X][1] == true)
{
return true;
}
return false;
}
static void insert(int a[], int n)
{
for (int i = 0; i < n; i++)
{
if (a[i] >= 0)
{
has[a[i]][0] = true;
}
else
{
has[Math.abs(a[i])][1] = true;
}
}
}
// Driver code
public static void main(String args[])
{
int a[] = {-1, 9, -5, -8, -5, -2};
int n = a.length;
insert(a, n);
int X = -5;
if (search(X) == true)
{
System.out.println("Present");
}
else
{
System.out.println("Not Present");
}
}
}
// This code is contributed
// by 29AjayKumar
# Python3 program to implement direct index
# mapping with negative values allowed.
# Searching if X is Present in the
function() {
}
data class {
}
fun main() {
println("hello world")
}
가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나public static void main(String[] args)다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람 $\int_{0}^{\infty} f(x) dx$ 가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람$$\int_{0}^{\infty} f(x) dx$$가나다람
$$\int_{0}^{\infty} f(x) dx$$
asdfasdfasdf\\[ \prod_{i=1}^N x_i \\]가나다람가나다람가나다람가나다람가나다람가나다람가$$a=3$$나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람가나다람 닮ㄴㅁ
- 가나다라
- 가나다라
- 가나다
- 가나가나다
- ㅁㄴㅇㄹ
#include <iostream>
#include <thread>
void hello() {
std::cout << "Hello Concurrent World\n";
}
int main() {
std::thread t(hello);
t.join();
}
# Python3 program to implement direct index
# mapping with negative values allowed.
# Searching if X is Present in the
# given array or not.
def search(X):
if X >= 0:
return has[X][0] == 1
# if X is negative take the absolute
# value of X.
X = abs(X)
return has[X][1] == 1
def insert(a, n):
for i in range(0, n):
if a[i] >= 0:
has[a[i]][0] = 1
else:
has[abs(a[i])][1] = 1
# Driver code
if __name__ == "__main__":
a = [-1, 9, -5, -8, -5, -2]
n = len(a)
MAX = 1000
# Since array is global, it is
# initialized as 0.
has = [[0 for i in range(2)]
for j in range(MAX + 1)]
insert(a, n)
X = -5
if search(X) == True:
print("Present")
else:
print("Not Present")
# This code is contributed by Rituraj Jain
// Java program to implement direct index
// mapping with negative values allowed.
class GFG
{
final static int MAX = 1000;
// Since array is global, it
// is initialized as 0.
static boolean[][] has = new boolean[MAX + 1][2];
// searching if X is Present in
// the given array or not.
static boolean search(int X)
{
if (X >= 0)
{
if (has[X][0] == true)
{
return true;
}
else
{
return false;
}
}
// if X is negative take the
// absolute value of X.
X = Math.abs(X);
if (has[X][1] == true)
{
return true;
}
return false;
}
static void insert(int a[], int n)
{
for (int i = 0; i < n; i++)
{
if (a[i] >= 0)
{
has[a[i]][0] = true;
}
else
{
has[Math.abs(a[i])][1] = true;
}
}
}
// Driver code
public static void main(String args[])
{
int a[] = {-1, 9, -5, -8, -5, -2};
int n = a.length;
insert(a, n);
int X = -5;
if (search(X) == true)
{
System.out.println("Present");
}
else
{
System.out.println("Not Present");
}
}
}
// This code is contributed
// by 29AjayKumar
# Python3 program to implement direct index
# mapping with negative values allowed.
# Searching if X is Present in the
# given array or not.
def search(X):
if X >= 0:
return has[X][0] == 1
# if X is negative take the absolute
# value of X.
X = abs(X)
return has[X][1] == 1
def insert(a, n):
for i in range(0, n):
if a[i] >= 0:
has[a[i]][0] = 1
else:
has[abs(a[i])][1] = 1
# Driver code
if __name__ == "__main__":
a = [-1, 9, -5, -8, -5, -2]
n = len(a)
MAX = 1000
# Since array is global, it is
# initialized as 0.
has = [[0 for i in range(2)]
for j in range(MAX + 1)]
insert(a, n)
X = -5
if search(X) == True:
print("Present")
else:
print("Not Present")
# This code is contributed by Rituraj Jain
#include <iostream>
#include <thread>
void hello() {
std::cout << "Hello Concurrent World\n";
}
int main() {
std::thread t(hello);
t.join();
}
가나다
가나다
가나다
다라마
다라마
바사아
다라마
test.py
a = {1: 'a', 2: 'b', 3: 'c'}
for i in a:
if i == 2:
a.pop(i)
$$\begin{bmatrix} & \colorbox{#0000FF}{ } & \\ \textcolor{blue}{F=ma} & \rule[6pt]{1ex}{6ex} & \rule[6pt]{6ex}{1ex} \end{bmatrix}$$
반응형
댓글