Skip to content

C++

LeetCode: 121-Best Time to Buy and Sell Stock 解題紀錄

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Read More »LeetCode: 121-Best Time to Buy and Sell Stock 解題紀錄

[已解決][C++] cannot pass non-trivial object of type 'std::__1::string' (aka 'basic_string, allocator >') to variadic function; expected type from format string was 'char *'

問題描述

在 C 語言當中，若是要印出字串型態的變數，我們經常會使用下列的語法：

Read More »[已解決][C++] cannot pass non-trivial object of type 'std::__1::string' (aka 'basic_string, allocator >') to variadic function; expected type from format string was 'char *'

LeetCode: 38-Count and Say 解題紀錄

題目

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:

    - countAndSay(1) = "1"
    - countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different digit string.

To determine how you "say" a digit string, split it into the minimal number of groups so that each group is a contiguous section all of the same character. Then for each group, say the number of characters, then say the character. To convert the saying into a digit string, replace the counts with a number and concatenate every saying.
Given a positive integer n, return the nth term of the count-and-say sequence.

Example:

Input: n = 1
Output: "1"
Explanation: This is the base case.

Input: n = 4
Output: "1211"
Explanation:
countAndSay(1) = "1"
countAndSay(2) = say "1" = one 1 = "11"
countAndSay(3) = say "11" = two 1's = "21"
countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"
Read More »LeetCode: 38-Count and Say 解題紀錄