轻风舞动

2018年9月15日

[LeetCode] 369. Plus One Linked List 链表加一运算

摘要： Given a non-negative number represented as a singly linked list of digits, plus one to the number. The digits are stored such that the most significan 阅读全文

posted @ 2018-09-15 07:14 轻风舞动阅读(524) 评论(0) 推荐(0)

[LeetCode] 109. Convert Sorted List to Binary Search Tree 把有序链表转成二叉搜索树

摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bina 阅读全文

posted @ 2018-09-15 06:54 轻风舞动阅读(727) 评论(0) 推荐(0)

[LeetCode] 108. Convert Sorted Array to Binary Search Tree 把有序数组转成二叉搜索树

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文

posted @ 2018-09-15 06:46 轻风舞动阅读(531) 评论(0) 推荐(0)

[LeetCode] 819. Most Common Word 最常见的单词

摘要： Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at leas 阅读全文

posted @ 2018-09-15 06:23 轻风舞动阅读(804) 评论(0) 推荐(0)

[LeetCode] 348. Design Tic-Tac-Toe 设计井字棋游戏

摘要： Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed to be valid and 阅读全文

posted @ 2018-09-15 04:35 轻风舞动阅读(1113) 评论(0) 推荐(0)

2018年9月14日

[LeetCode] 746. Min Cost Climbing Stairs

摘要： On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y 阅读全文

posted @ 2018-09-14 15:23 轻风舞动阅读(225) 评论(0) 推荐(0)

2018年9月13日

[LeetCode] 45. Jump Game II 跳跃游戏 II

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文

posted @ 2018-09-13 15:30 轻风舞动阅读(492) 评论(0) 推荐(0)

[LeetCode] 55. Jump Game 跳跃游戏

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文

posted @ 2018-09-13 15:24 轻风舞动阅读(467) 评论(0) 推荐(0)

[LeetCode] 163. Missing Ranges 缺失区间

摘要： Given a sorted integer array nums, where the range of elements are in the inclusive range [lower, upper], return its missing ranges. Example: Java: Ja 阅读全文

posted @ 2018-09-13 14:49 轻风舞动阅读(1258) 评论(0) 推荐(0)

[LeetCode] 228. Summary Ranges 总结区间

摘要： Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Example 2: Java: Python: Python: Python: C++: C++: 类似题目：阅读全文

posted @ 2018-09-13 14:38 轻风舞动阅读(830) 评论(0) 推荐(0)

公告