Difficult:Hard

題目

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

The overall run time complexity should be O(log (m+n)).

Difficult:Medium

題目

Given a string s, find the length of the longest substring without repeating characters.

Difficulty: Medium

題目

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Difficulty: Easy

規則

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

前言

本篇主要介紹如何使用 Hexo 並搭配 GitHub 來快速架設網誌。從介紹什麼是 Hexo 框架，該如何安裝、建立環境，接著介紹一些常用指令，以及如何部署到 GitHub 上。

文章大綱：

• 前置作業
  • Node.js
  • VsCode
  • Git
• 建立 GitHub Pages 環境
• Hexo 環境建置
• 常用指令
• 部署到 GitHub
  • 建立 GitHub 專案
  • 將檔案發布到 GitHub
    閱讀全文 »