siriusli - 博客园

2019年2月10日

[Lintcode]116. Jump Game/[Leetcode]55. Jump Game

摘要： "116. Jump Game" / "55. Jump Game" 本题难度: Medium Topic: Greedy Description Given an array of non negative integers, you are initially positioned at the 阅读全文

posted @ 2019-02-10 21:21 siriusli 阅读(119) 评论(0) 推荐(0)

[Lintcode]182. Delete Digits

摘要： "182. Delete Digits" 本题难度: Medium Topic: Greedy Description Given string A representative a positive integer which has N digits, remove any k digits o 阅读全文

posted @ 2019-02-10 20:49 siriusli 阅读(116) 评论(0) 推荐(0)

[Lintcode]184. Largest Number/[Leetcode]179. Largest Number

摘要： "184. Largest Number" / "179. Largest Number" 本题难度: Medium Topic: Greedy Description 184. Largest Number 中文English Given a list of non negative intege 阅读全文

posted @ 2019-02-10 19:44 siriusli 阅读(188) 评论(0) 推荐(0)

[Lintcode]187. Gas Station/[Leetcode]134. Gas Station

摘要： "187. Gas Station" / "134. Gas Station" 本题难度: Medium Topic: Greedy Description There are N gas stations along a circular route, where the amount of ga 阅读全文

posted @ 2019-02-10 19:32 siriusli 阅读(120) 评论(0) 推荐(0)

[Lintcode]46. Majority Element/[Leetcode]169. Majority Element

摘要： "46. Majority Element" /[169. Majority Element(https://leetcode.com/problems/majority element/) 本题难度: Easy Topic: Greedy Description Given an array of 阅读全文

posted @ 2019-02-10 18:28 siriusli 阅读(116) 评论(0) 推荐(0)

[Lintcode]82. Single Number/[Leetcode]136. Single Number

摘要： "82. Single Number" / "136. Single Number" 本题难度: Easy Topic: Greedy Description Given a non empty array of integers, every element appears twice excep 阅读全文

posted @ 2019-02-10 18:18 siriusli 阅读(127) 评论(0) 推荐(0)

[Lintcode]163. Unique Binary Search Trees

摘要： "163. Unique Binary Search Trees" 本题难度: Medium Topic: Bit Manipulation Description Given n, how many structurally unique BSTs (binary search trees) th 阅读全文

posted @ 2019-02-10 18:01 siriusli 阅读(117) 评论(0) 推荐(0)

[Lintcode]179. Update Bits

摘要： "179. Update Bits" 本题难度: Medium Topic: Bit Manipulation Description Given two 32 bit numbers, N and M, and two bit positions, i and j. Write a method 阅读全文

posted @ 2019-02-10 17:54 siriusli 阅读(153) 评论(0) 推荐(0)

[Lintcode]140. Fast Power

摘要： "140. Fast Power" 本题难度: Medium Topic: Bit Manipulation Description Calculate the a^n % b where a, b and n are all 32bit positive integers. Example For 阅读全文

posted @ 2019-02-10 16:54 siriusli 阅读(167) 评论(0) 推荐(0)

[Lintcode]180. Binary Representation

摘要： "180. Binary Representation" 本题难度: Hard Topic: Bit Manipulation Description Given a (decimal e.g. 3.72) number that is passed in as a string, return t 阅读全文

posted @ 2019-02-10 15:59 siriusli 阅读(133) 评论(0) 推荐(0)

公告