일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 | 31 |
- 기초
- 프로그래밍
- 마리아 DB
- 리눅스
- 등차수열
- ubuntu
- mysql
- 우분투
- Linux
- MSG
- 토픽
- 오늘도 우라라
- 데이터 베이스
- mariaDB
- 환경설정
- 반복문
- publish
- 오늘도 우라라 공략
- Subscribe
- LeetCode
- ros
- JungOl
- topic
- C언어
- C++
- install opencv-4.4.0 on ubuntu 22.04
- 오늘도 우라라 펫 공략
- while
- 오늘도 우라라 펫
- 그랑사가
- Today
- Total
목록분류 전체보기 (219)
하루의 쉼터
Question : Reverse a singly linked list. Exapmle : Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? Solution.h #include #include #include struct ListNode { int val; ListNode* next; ListNode() : val(0), next(nullptr) {} ListNode(int x) : val(x), next(nullptr) {} ListNode(int x, ListNode* ne..
0. Explanatory notes 파이썬 리스트는 매우 간편함 1. Code a=[2,4,6] b=a print(a) print(b) 2. Result 3. Github github.com/Anchangun/Python_Study/tree/main/OReilly/Introduction_Python/Chapter_02/Use_list_and_reassign_name Anchangun/Python_Study Contribute to Anchangun/Python_Study development by creating an account on GitHub. github.com
0. Explanatory notes type, isinstance 라는 간편한 함수 존재 1. Code print(type(7)) print(type(7)==int) print(isinstance(7,int)) print(isinstance(7,str)) 2. Result 3. github : github.com/Anchangun/Python_Study/tree/main/OReilly/Introduction_Python/Chapter_02/Example_of_variable_type Anchangun/Python_Study Contribute to Anchangun/Python_Study development by creating an account on GitHub. github.com
0. Explanatory notes 변수 타입이 없어서 새롭게 느껴졌음, print문도 새로운 형태이지 않나 싶음. print 사용 자체는 C에 느낌도 가지고 있음. 1. Code : x=5 y=x+12 y print("y : %d "%(y)) print("x : %d"%(x)) print("y_1 :",y) 2. Result github : github.com/Anchangun/Python_Study/tree/main/OReilly/Introduction_Python/Chapter_02/Example_of_Using_variables Anchangun/Python_Study Contribute to Anchangun/Python_Study development by creating an account..
1. 코드 two=deux=zwei=2 print(two) print(deux) print(zwei) 2. Result github : github.com/Anchangun/Python_Study/tree/main/OReilly/Introduction_Python/Chapter_02/Assign_Multiple_Names Anchangun/Python_Study Contribute to Anchangun/Python_Study development by creating an account on GitHub. github.com
| 처음으로 시작하는 파이썬_Chapter01 구매 : smartstore.naver.com/bookmoamoa/products/5257345568?NaPm=ct%3Dkibnt7n4%7Cci%3D069b88a4ff6dc2e57dda5d12833caefb5a78cd29%7Ctr%3Dslsl%7Csn%3D1209611%7Chk%3D1891edf6c0d45853e4ce422fd63afaa87f3c7322 빌 루바노빅 처음 시작하는 파이썬 책 한빛미디어 : 도서모아 [도서모아] 안녕하세요 smartstore.naver.com print("hi Python")
Question : Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6...
IDLE 이란? 참고 : en.wikipedia.org/wiki/IDLE IDLE - Wikipedia IDLE (short for Integrated Development and Learning Environment)[1][2] is an integrated development environment for Python, which has been bundled with the default implementation of the language since 1.5.2b1.[3][4] It is packaged as an optional part of th en.wikipedia.org 파이썬을 사용하기 쉽게 만들어주는 통합 환경 1. 설치 sudo apt-get install idle-python3.7..