一個小小工程師的心情抒發天地

主題: 如何允許ubuntu無密碼且用root自動登入

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i].

Return the answer in an array.

You're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in S is a type of stone you have.  You want to know how many of the stones you have are also jewels.

The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A".

最近因為刷起leetcode，所以用到了蠻大量的string這個類型，

Given an array of integers nums.

A pair (i,j) is called good if nums[i] == nums[j] and i < j.

剛剛看了紀錄，很可怕的是我七月份都沒有任何一次更新，