modified leetcode posts for terminal shortcode hugo

SamirPaulb · Feb 8, 2024 · 7a589a0 · 7a589a0
1 parent c06b270
commit 7a589a0
Show file tree

Hide file tree

Showing 411 changed files with 169 additions and 482 deletions.
diff --git a/content/posts/leetcode/0007-reverse-integer.md b/content/posts/leetcode/0007-reverse-integer.md
@@ -197,8 +197,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int reverse(int x) {
     int ans = 0;
     for (; x != 0; x /= 10) {

diff --git a/content/posts/leetcode/0041-first-missing-positive.md b/content/posts/leetcode/0041-first-missing-positive.md
@@ -240,8 +240,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int firstMissingPositive(int* nums, int numsSize) {
 
     int Max = nums[0], i, *Count;

diff --git a/content/posts/leetcode/0045-jump-game-ii.md b/content/posts/leetcode/0045-jump-game-ii.md
@@ -197,8 +197,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 #define min(a, b) a < b ? a : b
 int jump(int* nums, int numsSize) {
     int dp[numsSize];

diff --git a/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md b/content/posts/leetcode/0104-maximum-depth-of-binary-tree.md
@@ -233,8 +233,8 @@ var maxDepth = function (root) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 /**
  * Definition for a binary tree node.
  * struct TreeNode {

diff --git a/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md b/content/posts/leetcode/0109-convert-sorted-list-to-binary-search-tree.md
@@ -382,8 +382,8 @@ var sortedListToBST = function (head) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 /**
  * Definition for singly-linked list.
  * struct ListNode {

diff --git a/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md b/content/posts/leetcode/0111-minimum-depth-of-binary-tree.md
@@ -273,8 +273,8 @@ var minDepth = function (root) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 /**
  * Definition for a binary tree node.
  * struct TreeNode {

diff --git a/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md b/content/posts/leetcode/0129-sum-root-to-leaf-numbers.md
@@ -290,8 +290,8 @@ var sumNumbers = function (root) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 /**
  * Definition for a binary tree node.
  * struct TreeNode {

diff --git a/content/posts/leetcode/0136-single-number.md b/content/posts/leetcode/0136-single-number.md
@@ -148,8 +148,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int singleNumber(int* nums, int numsSize) {
     int ans = 0;
     for (int i = 0; i < numsSize; i++) {

diff --git a/content/posts/leetcode/0137-single-number-ii.md b/content/posts/leetcode/0137-single-number-ii.md
@@ -153,8 +153,8 @@ impl Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int singleNumber(int* nums, int numsSize) {
     int ans = 0;
     for (int i = 0; i < 32; i++) {

diff --git a/content/posts/leetcode/0175-combine-two-tables.md b/content/posts/leetcode/0175-combine-two-tables.md
@@ -110,7 +110,6 @@ def combine_two_tables(person: pd.DataFrame, address: pd.DataFrame) -> pd.DataFr
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT firstName, lastName, city, state
 FROM

diff --git a/content/posts/leetcode/0176-second-highest-salary.md b/content/posts/leetcode/0176-second-highest-salary.md
@@ -109,7 +109,6 @@ def second_highest_salary(employee: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT
     (
@@ -128,7 +127,6 @@ SELECT
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT MAX(salary) AS SecondHighestSalary
 FROM Employee
@@ -143,7 +141,6 @@ WHERE salary < (SELECT MAX(salary) FROM Employee);
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 WITH T AS (SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) AS rk FROM Employee)
 SELECT (SELECT DISTINCT salary FROM T WHERE rk = 2) AS SecondHighestSalary;

diff --git a/content/posts/leetcode/0177-nth-highest-salary.md b/content/posts/leetcode/0177-nth-highest-salary.md
@@ -101,7 +101,6 @@ def nth_highest_salary(employee: pd.DataFrame, N: int) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INT
 BEGIN
     SET N = N - 1;

diff --git a/content/posts/leetcode/0178-rank-scores.md b/content/posts/leetcode/0178-rank-scores.md
@@ -98,7 +98,6 @@ def order_scores(scores: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT
     score,
@@ -114,7 +113,6 @@ FROM Scores;
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 SELECT
     Score,
     CONVERT(rk, SIGNED) `Rank`

diff --git a/content/posts/leetcode/0180-consecutive-numbers.md b/content/posts/leetcode/0180-consecutive-numbers.md
@@ -95,7 +95,6 @@ def consecutive_numbers(logs: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT DISTINCT l2.num AS ConsecutiveNums
 FROM
@@ -116,7 +115,6 @@ We can also group the numbers by using the `IF` function to determine whether th
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 WITH
     T AS (
@@ -139,7 +137,6 @@ WHERE a = num AND b = num;
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 WITH
     T AS (

diff --git a/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md b/content/posts/leetcode/0181-employees-earning-more-than-their-managers.md
@@ -85,7 +85,6 @@ def find_employees(employee: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 SELECT Name AS Employee
 FROM Employee AS Curr
 WHERE
@@ -104,7 +103,6 @@ WHERE
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT
     e1.name AS Employee

diff --git a/content/posts/leetcode/0182-duplicate-emails.md b/content/posts/leetcode/0182-duplicate-emails.md
@@ -85,7 +85,6 @@ def duplicate_emails(person: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT email
 FROM Person
@@ -103,7 +102,6 @@ We can use a self-join to join the `Person` table with itself, and then filter o
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 SELECT DISTINCT p1.email
 FROM
     person AS p1,

diff --git a/content/posts/leetcode/0183-customers-who-never-order.md b/content/posts/leetcode/0183-customers-who-never-order.md
@@ -111,7 +111,6 @@ def find_customers(customers: pd.DataFrame, orders: pd.DataFrame) -> pd.DataFram
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT name AS Customers
 FROM Customers
@@ -132,7 +131,6 @@ Use `LEFT JOIN` to join the tables and return the data where `CustomerId` is `NU
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT name AS Customers
 FROM

diff --git a/content/posts/leetcode/0184-department-highest-salary.md b/content/posts/leetcode/0184-department-highest-salary.md
@@ -100,7 +100,6 @@ We can use an equi-join to join the `Employee` table and the `Department` table
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT d.name AS department, e.name AS employee, salary
 FROM
@@ -124,7 +123,6 @@ We can use an equi-join to join the `Employee` table and the `Department` table
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 WITH
     T AS (

diff --git a/content/posts/leetcode/0185-department-top-three-salaries.md b/content/posts/leetcode/0185-department-top-three-salaries.md
@@ -139,7 +139,6 @@ def top_three_salaries(
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 SELECT
     Department.NAME AS Department,
     Employee.NAME AS Employee,
@@ -165,7 +164,6 @@ WHERE
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 WITH
     T AS (

diff --git a/content/posts/leetcode/0191-number-of-1-bits.md b/content/posts/leetcode/0191-number-of-1-bits.md
@@ -166,8 +166,8 @@ var hammingWeight = function (n) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int hammingWeight(uint32_t n) {
     int ans = 0;
     while (n) {

diff --git a/content/posts/leetcode/0196-delete-duplicate-emails.md b/content/posts/leetcode/0196-delete-duplicate-emails.md
@@ -88,7 +88,6 @@ def delete_duplicate_emails(person: pd.DataFrame) -> None:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 DELETE FROM Person
 WHERE id NOT IN (SELECT MIN(id) FROM (SELECT * FROM Person) AS p GROUP BY email);
@@ -102,7 +101,6 @@ WHERE id NOT IN (SELECT MIN(id) FROM (SELECT * FROM Person) AS p GROUP BY email)
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 DELETE FROM Person
 WHERE
@@ -130,7 +128,6 @@ WHERE
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 DELETE p2
 FROM
     person AS p1

diff --git a/content/posts/leetcode/0197-rising-temperature.md b/content/posts/leetcode/0197-rising-temperature.md
@@ -89,7 +89,6 @@ def rising_temperature(weather: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT w1.id
 FROM
@@ -106,7 +105,6 @@ FROM
 <!-- tabs:start -->
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT w1.id
 FROM

diff --git a/content/posts/leetcode/0202-happy-number.md b/content/posts/leetcode/0202-happy-number.md
@@ -191,8 +191,8 @@ impl Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int getNext(int n) {
     int res = 0;
     while (n) {

diff --git a/content/posts/leetcode/0217-contains-duplicate.md b/content/posts/leetcode/0217-contains-duplicate.md
@@ -178,8 +178,8 @@ class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int cmp(const void* a, const void* b) {
     return *(int*) a - *(int*) b;
 }

diff --git a/content/posts/leetcode/0237-delete-node-in-a-linked-list.md b/content/posts/leetcode/0237-delete-node-in-a-linked-list.md
@@ -217,8 +217,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 /**
  * Definition for singly-linked list.
  * struct ListNode {

diff --git a/content/posts/leetcode/0242-valid-anagram.md b/content/posts/leetcode/0242-valid-anagram.md
@@ -211,8 +211,8 @@ public class Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int cmp(const void* a, const void* b) {
     return *(char*) a - *(char*) b;
 }
@@ -265,8 +265,8 @@ impl Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 bool isAnagram(char* s, char* t) {
     int n = strlen(s);
     int m = strlen(t);

diff --git a/content/posts/leetcode/0262-trips-and-users.md b/content/posts/leetcode/0262-trips-and-users.md
@@ -178,7 +178,6 @@ def trips_and_users(trips: pd.DataFrame, users: pd.DataFrame) -> pd.DataFrame:
 {{< /terminal >}}
 
 ```sql
-{{< /terminal >}}
 # Write your MySQL query statement below
 SELECT
     request_at AS Day,

diff --git a/content/posts/leetcode/0283-move-zeroes.md b/content/posts/leetcode/0283-move-zeroes.md
@@ -171,8 +171,8 @@ var moveZeroes = function (nums) {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 void moveZeroes(int* nums, int numsSize) {
     int i = 0;
     for (int j = 0; j < numsSize; j++) {

diff --git a/content/posts/leetcode/0303-range-sum-query---immutable.md b/content/posts/leetcode/0303-range-sum-query---immutable.md
@@ -284,8 +284,8 @@ class NumArray {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 typedef struct {
     int* s;
 } NumArray;

diff --git a/content/posts/leetcode/0343-integer-break.md b/content/posts/leetcode/0343-integer-break.md
@@ -143,8 +143,8 @@ impl Solution {
 ```
 {{< /terminal >}}
 
+{{< terminal title="C Code" >}}
 ```c
-{{< /terminal >}}
 int integerBreak(int n) {
     if (n < 4) {
         return n - 1;

diff --git a/content/posts/leetcode/0367-valid-perfect-square.md b/content/posts/leetcode/0367-valid-perfect-square.md
@@ -178,7 +178,6 @@ impl Solution {
 This is a math problem：
 
 ```bash
-{{< /terminal >}}
 1 = 1
 4 = 1 + 3
 9 = 1 + 3 + 5
-Original file line number
+Diff line change
@@ Expand Up / @@ -178,7 +178,6 @@ impl Solution { @@
     This is a math problem：
     ```bash
-    {{< /terminal >}}
 = 1
 = 1 + 3
 = 1 + 3 + 5
@@ Expand Down @@