본문 바로가기

아무고토 몰라효

검색하기
아무고토 몰라효
프로필사진 Always Newbie

  • 분류 전체보기 (65)
    • CS (0)
    • Coding Test (11)
    • Android (이론) (9)
    • Android ( JAVA ) (31)
      • 개발 (30)
      • 오류 (1)
    • Android ( Kotlin ) (5)
      • 개발 (5)
    • Flutter (7)
      • 개발 (7)
    • SQL (2)
      • ✦✧✧✧✧ (2)
Guestbook
관리 메뉴
  • 글쓰기
  • 방명록
  • RSS
  • 관리
반응형

목록Coding Test (11)

아무고토 몰라효

[LeetCode] Two Sum

https://leetcode.com/problems/two-sum/문제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] ..

Coding Test 2025. 7. 10. 14:55
Prev 1 2 Next

Blog is powered by kakao / Designed by Tistory

티스토리툴바