无惧风云 - 博客园

2017年5月5日

摘要： Total Accepted: 12212 Total Submissions: 26829 Difficulty: Easy Contributors:satyapriya Total Accepted: 12212 Total Submissions: 26829 Difficulty: Eas 阅读全文

posted @ 2017-05-05 18:05 无惧风云阅读(279) 评论(0) 推荐(0)

242. Valid Anagram（LeetCode）

摘要： Given two strings s and t, write a function to determine if t is an anagram of s. For example,s = "anagram", t = "nagaram", return true.s = "rat", t = 阅读全文

posted @ 2017-05-05 15:59 无惧风云阅读(185) 评论(0) 推荐(0)

169. Majority Element（LeetCode）

摘要： Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文

posted @ 2017-05-05 14:46 无惧风云阅读(124) 评论(0) 推荐(0)

100. Same Tree（LeetCode）

摘要： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a 阅读全文

posted @ 2017-05-05 08:59 无惧风云阅读(151) 评论(0) 推荐(0)

2017年5月4日

171. Excel Sheet Column Number（LeetCode）

摘要： Related to question Excel Sheet Column Title Given a column title as appear in an Excel sheet, return its corresponding column number. For example: 别人阅读全文

posted @ 2017-05-04 15:41 无惧风云阅读(135) 评论(0) 推荐(0)

168. Excel Sheet Column Title（LeetCode）

摘要： Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 我看别人提交的代码：阅读全文

posted @ 2017-05-04 14:57 无惧风云阅读(148) 评论(0) 推荐(0)

2017年5月3日

122.Best Time to Buy and Sell Stock II(LeetCode)

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2017-05-03 16:10 无惧风云阅读(128) 评论(0) 推荐(0)

404. Sum of Left Leaves（LeetCode）

摘要： Find the sum of all left leaves in a given binary tree. Example: 阅读全文

posted @ 2017-05-03 08:52 无惧风云阅读(144) 评论(0) 推荐(0)

2017年5月2日

566. Reshape the Matrix（LeetCode）

摘要： 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. 阅读全文

posted @ 2017-05-02 14:49 无惧风云阅读(461) 评论(0) 推荐(0)

349. Intersection of Two Arrays（LeetCode）

摘要： Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文

posted @ 2017-05-02 13:56 无惧风云阅读(164) 评论(0) 推荐(0)