25.贪心算法:leetcode122

   
  leetcode / 待补充
  a minute read (About 215 words)

problem

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

  greedy
  Read More

23.分治：leetcode-169

   
  leetcode / 待补充
  2 minutes read (About 239 words)

problem

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 array is non-empty and the majority element always exist in the array.

Example 1:

1
2
3
4
5
6
Input: [3,2,3]
Output: 3
Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2
  Read More
  Follow

Tag Cloud

BST DFS array backtracking binary-search dequeue greedy linux map notbest priorityQueue queue redis stack tree two-pointers 栈 链表

Recent

Archives

Tags

BST 1
DFS 1
array 1
backtracking 1
binary-search 1
dequeue 1
greedy 1
linux 1
map 2
notbest 1
priorityQueue 2
queue 3
redis 1
stack 1
tree 4
two-pointers 1
栈 1
链表 3
Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×