일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 러닝 스칼라
- 파이썬
- deep learning
- Shellcode
- php
- 인공지능
- backend
- hacking
- mysql
- Scala
- Web
- webhacking
- Javascript
- BOF 원정대
- ChatGPT
- hackthissite
- BOF
- c
- 경제
- 백엔드
- c++
- Linux
- hackerschool
- flask
- 러닝스칼라
- 리눅스
- 웹해킹
- 딥러닝
- Python
- 챗GPT
- Today
- Total
목록알고리즘 (2)
jam 블로그
문제 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1: Input: l1 = [2,4,3], l2 = [5,6,4] Output: [7,0,8] Explanation: 34..
문제 Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]...