你好哇傻小妞

2019年7月18日

摘要：题目描述 Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words 阅读全文

posted @ 2019-07-18 19:51 你好哇傻小妞阅读(190) 评论(1) 推荐(0)

LeetCode-335 Self Crossing

摘要：题目描述 You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] m 阅读全文

posted @ 2019-07-18 15:56 你好哇傻小妞阅读(215) 评论(0) 推荐(0)

LeetCode-334 Increasing Triplet Subsequence

摘要：题目描述 Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Note: Your 阅读全文

posted @ 2019-07-18 11:23 你好哇傻小妞阅读(143) 评论(0) 推荐(0)

2019年7月17日

LeetCode-332 Reconstruct Itinerary

摘要：题目描述 Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the 阅读全文

posted @ 2019-07-17 15:29 你好哇傻小妞阅读(184) 评论(0) 推荐(0)

LeetCode-331 Verify Preorder Serialization of a Binary Tree

摘要：题目描述 One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null 阅读全文

posted @ 2019-07-17 11:35 你好哇傻小妞阅读(113) 评论(0) 推荐(0)

LeetCode-330 Patching Array

摘要：题目描述 Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can b 阅读全文

posted @ 2019-07-17 10:40 你好哇傻小妞阅读(121) 评论(0) 推荐(0)

2019年7月16日

LeetCode-329 Longest Increasing Path in a Matrix

摘要：题目描述 Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up 阅读全文

posted @ 2019-07-16 15:34 你好哇傻小妞阅读(151) 评论(0) 推荐(0)

LeetCode-328 Odd Even Linked List

摘要：题目描述 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and no 阅读全文

posted @ 2019-07-16 14:40 你好哇傻小妞阅读(121) 评论(0) 推荐(0)

LeetCode-327 Count of Range Sum

摘要：题目描述 Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the sum of the 阅读全文

posted @ 2019-07-16 11:16 你好哇傻小妞阅读(142) 评论(0) 推荐(0)

2019年7月15日

LeetCode-326 Power of Three

摘要：题目描述 Given an integer, write a function to determine if it is a power of three. 题目大意判断给的整数是否是3的乘方数。（尽量不要用循环和递归来完成算法）示例 E1 Input: 27 Output: true E2 阅读全文

posted @ 2019-07-15 15:20 你好哇傻小妞阅读(104) 评论(0) 推荐(0)

你好哇傻小妞

公告