본문 바로가기

5 DERECHA

검색하기
5 DERECHA
프로필사진 kay30

  • 분류 전체보기 (55)
    • Algorithm (3)
      • PRO (2)
      • Array (0)
      • Binary (0)
      • Dynamic Programming (0)
      • Interval (0)
      • Matrix (0)
      • String (0)
      • Graph(DFS, BFS and so on)_T.. (2)
      • Linked List (0)
      • Heap(Priority Queue) (0)
      • Two-Pointers (1)
      • Greedy (1)
    • SAMSUNG Coding Exam (1)
    • HYUNDAI Coding Exam (1)
    • LG Coding Exam (0)
    • NAVER Coding Exam (0)
    • Interview (4)
    • Front-end (1)
      • React-Native (1)
    • Architecture (1)
      • OOAD (0)
      • Design pattern (1)
    • Operating System (5)
      • kernel Loading (1)
    • Hard nut to crack (1)
      • Link Error (1)
      • Compile Error (0)
    • Linux (9)
    • Embedded (5)
      • ARM (1)
    • ARM (1)
      • Performance (1)
    • My projects (0)
Guestbook
Notice
Recent Posts
Recent Comments
Link
«   2025/08   »
일 월 화 수 목 금 토
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
Tags
  • 스택
  • link error
  • LNK2005
more
Archives
Today
Total
관리 메뉴
  • 글쓰기
  • 방명록
  • RSS
  • 관리

목록Algorithm/Greedy (1)

5 DERECHA

✅ 881. Boats to Save People || C++ || 2 Pointers || Greedy Algorithms || Approach explanation

Intuition & Approach In this problem, they gave us two parametes which are vectory array 'the weights of persons' and an integer which is the maximum weight that boat can carry. And what we need to return is the minimum number of boats to carry every given person. So, In navie thinking, we could check all the persons in people array whether they can share their boat with anoterh person or not. H..

Algorithm/Greedy 2023. 4. 3. 13:40
이전 Prev 1 Next 다음

Blog is powered by kakao / Designed by Tistory

티스토리툴바