程序媛詹妮弗

2018年10月22日

摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Example: Input: n = 4, k = 2 Output: [ [2,4], [3,4], [2,3], 阅读全文

posted @ 2018-10-22 07:06 程序媛詹妮弗阅读(110) 评论(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 @ 2018-10-22 07:03 程序媛詹妮弗阅读(126) 评论(0) 推荐(0)

[leetcode]716. Max Stack 最大栈

摘要： Design a max stack that supports push, pop, top, peekMax and popMax. Example 1: Note: 题目思路 1. maintain stack to track all the data 2. maintain maxSta 阅读全文

posted @ 2018-10-22 06:31 程序媛詹妮弗阅读(742) 评论(0) 推荐(0)

[leetcode]21. Merge Two Sorted Lists合并两个链表

摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: 阅读全文

posted @ 2018-10-22 06:15 程序媛詹妮弗阅读(179) 评论(0) 推荐(0)

[leetcode]128. Longest Consecutive Sequence最长连续序列

摘要： Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Examp 阅读全文

posted @ 2018-10-22 06:05 程序媛詹妮弗阅读(150) 评论(0) 推荐(0)

2018年10月21日

[leetcode]694. Number of Distinct Islands你究竟有几个异小岛？

摘要： Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) Yo 阅读全文

posted @ 2018-10-21 16:02 程序媛詹妮弗阅读(226) 评论(0) 推荐(0)

[leetcode]8. String to Integer (atoi)字符串转整数

摘要： Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-white 阅读全文

posted @ 2018-10-21 15:11 程序媛詹妮弗阅读(141) 评论(0) 推荐(0)

[leetcode]101. Symmetric Tree对称树

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

posted @ 2018-10-21 14:59 程序媛詹妮弗阅读(119) 评论(0) 推荐(0)

[leetcode]658. Find K Closest Elements绝对距离最近的K个元素

摘要： Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If the 阅读全文

posted @ 2018-10-21 14:30 程序媛詹妮弗阅读(305) 评论(0) 推荐(0)

[leetcode]692. Top K Frequent Words 最高频K个单词

摘要： Given a non-empty list of words, return the k most frequent elements. Your answer should be sorted by frequency from highest to lowest. If two words h 阅读全文

posted @ 2018-10-21 07:54 程序媛詹妮弗阅读(166) 评论(0) 推荐(0)