최근 포스트

  1. Partition Array for Maximum Sum

1 분 소요

1043. Partition Array for Maximum Sum class Solution { public: int maxSumAfterPartitioning(vector<int>& arr, int k) { int len = arr.siz...

  1. Mirror Reflection

1 분 소요

858. Mirror Reflection ```cpp class Solution { int gcd(int a,int b) { while(true) { int r = a%b; if (r == 0) { return b; ...

  1. Monotone Increasing Digits

2 분 소요

738. Monotone Increasing Digits class Solution { public: int monotoneIncreasingDigits(int n) { int result = 0; while (n) { in...

  1. Distant Barcodes

1 분 소요

1054. Distant Barcodes ```cpp class Solution { struct cmp{ bool operator()(int a, int b){ return (a & 0xffff) < (b & 0xfff...

  1. Minimum Jumps to Reach Home

2 분 소요

1654. Minimum Jumps to Reach Home class Solution { public: int minimumJumps(vector<int>& forbidden, int a, int b, int x) { if (x == 0) ...