Fork me on GitHub

09 2017 档案

POJ 2287 田忌赛马 贪心算法
摘要：田忌赛马，大致题意是田忌和国王赛马，赢一局得200元，输一局输掉200元，平局则财产不动。 先输入一个整数N，接下来一行是田忌的N匹马，下一行是国王的N匹马。当N为0时结束。 此题为贪心算法解答，有两种思路。 思路二： 1、开始也是先排序，可以使用sort快排； 2、然后将田忌最大的马与国王进行比较 阅读全文
posted @ 2017-09-27 15:30 hellowOOOrld 阅读(3740) 评论(0) 推荐(1)
[leetcode-304-Range Sum Query 2D - Immutable]
摘要：Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2 阅读全文
posted @ 2017-09-24 16:14 hellowOOOrld 阅读(219) 评论(0) 推荐(0)
[leetcode-682-Baseball Game]
摘要：You're now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types: Each round's operation is permane 阅读全文
posted @ 2017-09-24 10:59 hellowOOOrld 阅读(151) 评论(0) 推荐(0)
[leetcode-299-Bulls and Cows]
摘要：You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time 阅读全文
posted @ 2017-09-22 10:00 hellowOOOrld 阅读(277) 评论(1) 推荐(0)
[leetcode-319-Bulb Switcher]
摘要：There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every 阅读全文
posted @ 2017-09-21 20:35 hellowOOOrld 阅读(198) 评论(0) 推荐(0)
[leetcode-680-Valid Palindrome II]
摘要：Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. Example 1: Input: "aba" Output: True Exa 阅读全文
posted @ 2017-09-20 17:28 hellowOOOrld 阅读(214) 评论(0) 推荐(0)
[leetcode-676-Implement Magic Dictionary]
摘要：Implement a magic directory with buildDict, and search methods. For the method buildDict, you'll be given a list of non-repetitive words to build a di 阅读全文
posted @ 2017-09-10 11:38 hellowOOOrld 阅读(195) 评论(0) 推荐(0)
[leetcode-674-Longest Continuous Increasing Subsequence]
摘要：Given an unsorted array of integers, find the length of longest continuous increasing subsequence. Example 1: Example 2: Note: Length of the array wil 阅读全文
posted @ 2017-09-10 11:28 hellowOOOrld 阅读(346) 评论(0) 推荐(0)
京东2018秋招c++岗 神奇数
摘要：题意大概是： 一个数比如242，把所有数字分成两组，而且两组的和相等，那么这个数就是神奇数，此时242，能够分成{2,2}和{4}，所以242是神奇数。 题目要求输入n和m求[n,m]区间内神奇数的个数。 思路： 对于任意一个数字，将每一位上的数字保存到数组里，并求所有位上的数字的和sum。然后使用 阅读全文
posted @ 2017-09-08 22:51 hellowOOOrld 阅读(658) 评论(0) 推荐(0)
[leetcode-84-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 @ 2017-09-04 14:23 hellowOOOrld 阅读(146) 评论(0) 推荐(0)
[leetcode-670-Maximum Swap]
摘要：Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get. 阅读全文
posted @ 2017-09-03 12:40 hellowOOOrld 阅读(683) 评论(0) 推荐(0)
[leetcode-669-Trim a Binary Search Tree]
摘要：Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might 阅读全文
posted @ 2017-09-03 11:54 hellowOOOrld 阅读(521) 评论(0) 推荐(0)
[leetcode-671-Second Minimum Node In a Binary Tree]
摘要：Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2017-09-03 11:32 hellowOOOrld 阅读(269) 评论(0) 推荐(0)
[leetcode-667-Beautiful Arrangement II]
摘要：Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requ 阅读全文
posted @ 2017-09-01 22:27 hellowOOOrld 阅读(290) 评论(0) 推荐(0)