Skip to content

Instantly share code, notes, and snippets.

Avatar
🎯
Focusing on Problem Solving!!!

tiger1710

🎯
Focusing on Problem Solving!!!
View GitHub Profile
View main.cpp
#include <iostream>
using namespace std;
int main(void) {
cout << "Hello, World!" << endl;
return 0;
}
View avl.c
//avl트리 책에 있는 소스 수정
#include <stdio.h>
#include <stdlib.h>
typedef struct avl_node {
struct avl_node *left_child, *right_child; /* Subtrees. */
int data; /* Pointer to data. */
}avl_node;
View 구조체.md

C에서의 구조체

들어가면서

코딩 꼭 같이 해보면서 해보세요.. ㅠㅠ 그럼 더 이해 잘 될것 같네요..

1. 배경

만약 학생을 데이터로 표현하고 싶다고하면, 이름, 학번, 학년을 데이터로 저장해야 한다.

@tiger1710
tiger1710 / Source.cpp
Last active Feb 11, 2019
기존의 피보나치수열의 재귀함수
View Source.cpp
#include <iostream>
using namespace std;
int f(int n) {
if (n < 0) return 0;
if (n < 2) return n;
return f(n - 1) + f(n - 2);
}
int main(void) {
View Tail Call.cpp
#include <iostream>
using namespace std;
int f(int a) {
a = 0;
return a;
}
int foo1(int b) {
return f(b) + 1;
View Tail Call Recursion.cpp
#include <iostream>
using namespace std;
int f(int n, int prev = 0, int next = 1) {
if (not n) return prev;
return f(n - 1, next, prev + next);
}
int main(void) {
cout << f(4) << '\n';
View 9466.cpp
#include <iostream>
#include <algorithm>
#include <vector>
#include <limits>
#include <string>
#define endl '\n'
#define point pair<int, int>
using namespace std;
enum {notChecked = -1, notGrouped, Grouped};
@tiger1710
tiger1710 / 12851.cpp
Last active Mar 3, 2020
Hide And Seek!
View 12851.cpp
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <limits>
#include <string>
#define endl '\n'
#define point pair<int, int>
using namespace std;
View what i learned.md

내가 알고리즘 문제풀면서 배운것들..

1.member function에서 private 변수의 &리턴하기

#include <iostream>
#include <vector>
using namespace std;

class Foo {
View myStack.c
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef struct stack {
char data;
struct stack *next;
}Stack;
You can’t perform that action at this time.