wxquare - 博客园

2016年10月9日

摘要： Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space. Hi 阅读全文

posted @ 2016-10-09 10:41 wxquare 阅读(159) 评论(0) 推荐(0) 编辑

Majority Element

摘要： Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文

posted @ 2016-10-09 10:40 wxquare 阅读(166) 评论(0) 推荐(0) 编辑

2016年10月8日

Longest Increasing Subsequence

摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文

posted @ 2016-10-08 14:58 wxquare 阅读(130) 评论(0) 推荐(0) 编辑

Count Primes

摘要： Description: Count the number of prime numbers less than a non-negative number, n. 阅读全文

posted @ 2016-10-08 11:19 wxquare 阅读(150) 评论(0) 推荐(0) 编辑

2016年10月3日

Valid Parentheses

摘要： Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the 阅读全文

posted @ 2016-10-03 23:23 wxquare 阅读(141) 评论(0) 推荐(0) 编辑

Largest Rectangle in Histogram

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2016-10-03 23:17 wxquare 阅读(136) 评论(0) 推荐(0) 编辑

Linked List Cycle II

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. 阅读全文

posted @ 2016-10-03 16:27 wxquare 阅读(150) 评论(0) 推荐(0) 编辑

Linked List Cycle

摘要： Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 阅读全文

posted @ 2016-10-03 16:26 wxquare 阅读(152) 评论(0) 推荐(0) 编辑

Evaluate Reverse Polish Notation

摘要： Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another e 阅读全文

posted @ 2016-10-03 11:38 wxquare 阅读(134) 评论(0) 推荐(0) 编辑

Longest Valid Parentheses

摘要： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the lo 阅读全文

posted @ 2016-10-03 10:46 wxquare 阅读(131) 评论(0) 推荐(0) 编辑

wxquare的学习笔记

公告