###### tags: `Weekly Contest`
# Weekly Contest 414

## [3280 Convert Date to Binary](https://leetcode.com/problems/convert-date-to-binary/) (<font color=#00B8A3>Easy</font>)

限制 :

<ul>
<li><code>10⁴</code></li>
</ul>
### Solution

#### 時間複雜度: $O(1)$

#### 空間複雜度: $O(1)$

程式碼:

class Solution {
public:
    string decToBinStr(int num) {
        string result;
        while (num > 0) {
            int dd = num % 2;
            num /= 2;
            result = char(dd + '0') + result;
        }
        return result;
    }

    string convertDateToBinary(string date) {
        int year, month, day;
        stringstream cha;
        cha << date;
        cha >> year >> month >> day;
        month = abs(month);
        day = abs(day);
        return decToBinStr(year) + "-" + decToBinStr(month) + "-" + decToBinStr(day);
    }
};

## [3281 Maximize Score of Numbers in Ranges](https://leetcode.com/problems/maximize-score-of-numbers-in-ranges/) (<font color=#FFC011>Medium</font>)

限制 :

<ul>
<li><code>10⁴</code></li>
</ul>
### Solution

#### 時間複雜度: $O()$

#### 空間複雜度: $O()$

程式碼:

## [3282 Reach End of Array With Max Score](https://leetcode.com/problems/reach-end-of-array-with-max-score/)(<font color=#FFC011>Medium</font>)

限制 :

<ul>
<li><code>10⁴</code></li>
</ul>
### Solution

#### 時間複雜度: $O()$

#### 空間複雜度: $O()$

程式碼:

## [3Maximum Number of Moves to Kill All Pawns](https://leetcode.com/problems/maximum-number-of-moves-to-kill-all-pawns/)(<font color=#FF375F>Hard</font>)

限制 :

<ul>
<li><code>10⁴</code></li>
</ul>
### Solution

#### 時間複雜度: $O()$

#### 空間複雜度: $O()$

程式碼: