CodesKiller - 博客园

2017年3月1日

摘要： In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach o 阅读全文

posted @ 2017-03-01 07:31 CodesKiller 阅读(544) 评论(0) 推荐(0)

293. Flip Game

摘要： You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take tu 阅读全文

posted @ 2017-03-01 03:00 CodesKiller 阅读(175) 评论(0) 推荐(0)

292. Nim Game

摘要： You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston 阅读全文

posted @ 2017-03-01 02:55 CodesKiller 阅读(109) 评论(0) 推荐(0)

294. Flip Game II

摘要： You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take tu 阅读全文

posted @ 2017-03-01 02:25 CodesKiller 阅读(178) 评论(0) 推荐(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 wron 阅读全文

posted @ 2017-03-01 01:26 CodesKiller 阅读(178) 评论(0) 推荐(0)

2017年2月28日

374. Guess Number Higher or Lower

摘要： 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 wron 阅读全文

posted @ 2017-02-28 12:06 CodesKiller 阅读(149) 评论(0) 推荐(0)

35. Search Insert Position

摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文

posted @ 2017-02-28 11:48 CodesKiller 阅读(156) 评论(0) 推荐(0)

278. First Bad Version

摘要： You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文

posted @ 2017-02-28 11:11 CodesKiller 阅读(88) 评论(0) 推荐(0)

34. Search for a Range

摘要： Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文

posted @ 2017-02-28 11:06 CodesKiller 阅读(134) 评论(0) 推荐(0)

106. Construct Binary Tree from Inorder and Postorder Traversal

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 本题和之前的105题比较阅读全文

posted @ 2017-02-28 07:19 CodesKiller 阅读(126) 评论(0) 推荐(0)

公告