前言我使用 macbook pro 2014 已经一年了，于是写篇总结吧。macbook 机器的亮点：轻薄，铝制机身，外观简洁美观触摸板真的很好用，我已经很久没用过鼠标了（但触摸板很不适合打游戏）键盘背光retina 屏也是非常养眼立体声也十分不错细节做得很好，充电口是磁吸的，正反两面都能充，指示灯是能显示是否充满的（用过 surfa...

Given a balanced parentheses string S, compute the score of the string based on the following rule:

Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

Given a string, your task is to count how many palindromic substrings in this string.

Each value v = grid[i][j] represents a tower of v cubes placed on top of grid cell (i, j).

Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions.

A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.

Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.

题目 You need to find the largest value in each row of a binary tree. Example: {代码...} 讲解 又是树的层次遍历题。相同的题我已经做了两个了：637. Average of Levels in Binary Tree、429. N-ary Tree Level Order Traversal Java代码 {代码...}

Return any binary tree that matches the given preorder and postorder traversals.

Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

You have an array of logs. Each log is a space delimited string of words.

Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Given a binary tree, find the leftmost value in the last row of the tree.

Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2.

In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.

There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room.

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute these candies equally in number to brother and sister. Return the maximum number of kinds of candies t...

Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N.

Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the result should return the new root of the trimmed binary search tree.

Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].

Given a list of strings, each string can be one of the 4 following types:

We are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.)

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.