leetcode
TaoTao Li
擅长C/C++、Python、Golang编程
熟悉推理服务、搜索引擎、算法平台化开发
展开
-
401.Binary Watch
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents a zero or one, with the least significant bit o原创 2016-10-10 20:40:05 · 470 阅读 · 0 评论 -
148. Sort List
Sort a linked list in O(n log n) time using constant space complexity. http://oj.leetcode.com/problems/sort-list/ 解题报告:就是对一个链表进行归并排序。 主要考察3个知识点, 知识点1:归并排序的整体思想 知识点2:找到一个链表的中间节点的方法 知识点3:合并两个已转载 2017-03-23 10:30:56 · 268 阅读 · 0 评论 -
78. Subsets 90. Subsets II
子集系列(一) 传统subset 问题,例 [LeetCode] Subset, Subset II, Bloomberg 的一道面试题 引言 Coding 问题中有时会出现这样的问题:给定一个集合,求出这个集合所有的子集(所谓子集,就是包含原集合中的一部分元素的集合)。 或者求出满足一定要求的子集,比如子集中元素总和为定值,子集元素个数为定值等等。 我把它们归类为子集系列问题转载 2017-03-20 14:55:19 · 298 阅读 · 0 评论 -
376. Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either pos原创 2017-02-10 11:10:11 · 316 阅读 · 0 评论 -
375. Guess Number Higher or Lower II
We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I'll tell you whether the number I pi原创 2017-02-09 15:01:41 · 256 阅读 · 0 评论 -
486. Predict the Winner
Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a原创 2017-02-07 14:36:31 · 1696 阅读 · 0 评论 -
494. Target Sum
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol. Find out原创 2017-02-06 17:00:21 · 2805 阅读 · 0 评论 -
447. Number of Boomerangs
Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between iand j equals the distance between i and k (the order of t原创 2016-11-09 20:41:22 · 290 阅读 · 0 评论 -
453. Minimum Moves to Equal Array Elements
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1. Example: Input: [1,2,3] Ou原创 2016-11-09 20:27:52 · 413 阅读 · 0 评论 -
113. Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / \原创 2016-10-26 11:24:57 · 253 阅读 · 0 评论 -
437. Path Sum III
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it原创 2016-10-26 12:24:17 · 390 阅读 · 0 评论 -
112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree and sum原创 2016-10-26 11:06:48 · 360 阅读 · 0 评论 -
415. Add Strings
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2. Note: The length of both num1 and num2 is Both num1 and num2 contains only digits 0-9.B原创 2016-10-13 23:17:04 · 361 阅读 · 0 评论 -
405. Convert a Number to Hexadecimal
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. Note: All letters in hexadecimal (a-f) must be in lowercase.The hexade原创 2016-10-11 10:22:37 · 324 阅读 · 0 评论 -
hdu-4597 动态规划
转自:https://blog.csdn.net/shuangde800/article/details/10277697题目链接: hdu-4597 Alice和Bob玩一个游戏,有两个长度为N的正整数数字序列,每次他们两个 只能从其中一个序列,选择两端中的一个拿走。他们都希望可以拿到尽量大 的数字之和,并且他们都足够聪明,每次都选择最优策略。Alice先选择,问 最终Alic...转载 2018-07-08 17:14:06 · 331 阅读 · 0 评论