04 2020 档案

[LeetCode] 191. Number of 1 Bits
摘要：Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight). Example 1: Example 2: Exa 阅读全文

posted @ 2020-04-24 02:28 codingEskimo 阅读(91) 评论(0) 推荐(0)

[LeetCode] 260. Single Number III
摘要：Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements 阅读全文

posted @ 2020-04-24 02:11 codingEskimo 阅读(83) 评论(0) 推荐(0)

[LeetCode] 200. Number of Islands
摘要：Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文

posted @ 2020-04-18 05:08 codingEskimo 阅读(326) 评论(0) 推荐(0)

[LeetCode] 678. Valid Parenthesis String
摘要：Given a string containing only three types of characters: '(', ')' and ' ', write a function to check whether this string is valid. We define the vali 阅读全文

posted @ 2020-04-17 10:00 codingEskimo 阅读(192) 评论(0) 推荐(0)

[LeetCode] 238. Product of Array Except Self
摘要：Given an array nums of n integers where n 1, return an array output such that output[i] is equal to the product of all the elements of nums except num 阅读全文

posted @ 2020-04-16 07:53 codingEskimo 阅读(121) 评论(0) 推荐(0)

[LeetCode] Weekly Challenge Perform String Shifts
摘要：You are given a string s containing lowercase English letters, and a matrix shift, where shift[i] = [direction, amount]: direction can be 0 (for left 阅读全文

posted @ 2020-04-14 23:40 codingEskimo 阅读(205) 评论(0) 推荐(0)

[LeetCode] 525. Contiguous Array
摘要：Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Example 2: Note: The length of the giv 阅读全文

posted @ 2020-04-14 09:30 codingEskimo 阅读(200) 评论(4) 推荐(0)

[LeetCode] 1046. Last Stone Weight
摘要：We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppos 阅读全文

posted @ 2020-04-13 05:14 codingEskimo 阅读(170) 评论(0) 推荐(0)

[LeetCode] 543. Diameter of Binary Tree
摘要：Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwe 阅读全文

posted @ 2020-04-12 10:56 codingEskimo 阅读(117) 评论(0) 推荐(0)

[LeetCode] 155. Min Stack
摘要：Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) Push element x onto stack. pop() Removes the 阅读全文

posted @ 2020-04-11 01:53 codingEskimo 阅读(111) 评论(0) 推荐(0)

[LeetCode] 844. Backspace String Compare
摘要：Given two strings S and T, return if they are equal when both are typed into empty text editors. means a backspace character. Example 1: Example 2: Ex 阅读全文

posted @ 2020-04-10 05:19 codingEskimo 阅读(136) 评论(0) 推荐(0)

[LeetCode] 876. Middle of the Linked List
摘要：Given a non empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middl 阅读全文

posted @ 2020-04-08 22:08 codingEskimo 阅读(105) 评论(0) 推荐(0)

[LeetCode] Weekly Challenge Counting Element
摘要：Given an integer array arr, count element x such that x + 1 is also in arr. If there're duplicates in arr, count them seperately. Example 1: Example 2 阅读全文

posted @ 2020-04-07 23:08 codingEskimo 阅读(201) 评论(0) 推荐(0)

[LeetCode] 49. Group Anagrams
摘要：Given an array of strings, group anagrams together. Example: Note: All inputs will be in lowercase. The order of your output does not matter. 这道题就是用每个 阅读全文

posted @ 2020-04-07 08:29 codingEskimo 阅读(131) 评论(0) 推荐(0)

[LeetCode] 122. Best Time to Buy And Sell Stock II
摘要：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 @ 2020-04-07 07:54 codingEskimo 阅读(128) 评论(0) 推荐(0)

[LeetCode] 121. Best Time to Buy And Sell Stock
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文

posted @ 2020-04-07 07:50 codingEskimo 阅读(117) 评论(0) 推荐(0)

[LeetCode] 283. Move Zeros
摘要：Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non zero elements. Example: Input: 阅读全文

posted @ 2020-04-06 10:47 codingEskimo 阅读(111) 评论(0) 推荐(0)

[LeetCode] 53. Maximum SubArray
摘要：Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Inpu 阅读全文

posted @ 2020-04-06 10:22 codingEskimo 阅读(121) 评论(0) 推荐(0)

[LeetCode] 202. Happy Number
摘要：Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive intege 阅读全文

posted @ 2020-04-06 06:42 codingEskimo 阅读(149) 评论(0) 推荐(0)

[LeetCode] LeetCode Summary 汇总
摘要：从今天开始努力刷题，用这个帖子来记录刷题的进度。也方便自己的寻找。 题号 题目 复习 1 Two Sum Y 2 Add Two Numbers Y 3 Longest Substring Without Repeating Characters Y 4 Median of Two Sorted A 阅读全文

posted @ 2020-04-06 05:42 codingEskimo 阅读(248) 评论(0) 推荐(0)

[Leetcode] 136. Single Number
摘要：Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runti 阅读全文

posted @ 2020-04-06 05:35 codingEskimo 阅读(119) 评论(0) 推荐(0)

导航