seyjs - 博客园

2019年12月8日

【leetcode】1276. Number of Burgers with No Waste of Ingredients

摘要：题目如下： Given two integers tomatoSlices and cheeseSlices. The ingredients of different burgers are as follows: Jumbo Burger: 4 tomato slices and 1 chees 阅读全文

posted @ 2019-12-08 06:37 seyjs 阅读(421) 评论(0) 推荐(0) 编辑

【leetcode】1275. Find Winner on a Tic Tac Toe Game

摘要：题目如下： Tic-tac-toe is played by two players A and B on a 3 x 3 grid. Here are the rules of Tic-Tac-Toe: Players take turns placing characters into empt 阅读全文

posted @ 2019-12-08 06:36 seyjs 阅读(506) 评论(0) 推荐(0) 编辑

2019年12月7日

【leetcode】1278. Palindrome Partitioning III

摘要：题目如下： You are given a string s containing lowercase letters and an integer k. You need to : First, change some characters of s to other lowercase Engl 阅读全文

posted @ 2019-12-07 08:27 seyjs 阅读(462) 评论(0) 推荐(0) 编辑

2019年12月6日

【SQL Server】使用SQL比较版本号

摘要：最近遇到这么一个场景，需要用SQL从表里取出版本号小于'10.2'的所有数据。目前表中以存在的数据中，版本号有两种格式，一个是'X.Y'，另一个是'X'。对于SQL Server来说，其没有string split函数，所以处理起来会麻烦一点。首先，我想到是用parsename函数，分别用'X.Y 阅读全文

posted @ 2019-12-06 16:26 seyjs 阅读(1464) 评论(0) 推荐(0) 编辑

2019年12月3日

【leetcode】1273. Delete Tree Nodes

摘要：题目如下： A tree rooted at node 0 is given as follows: The number of nodes is nodes; The value of the i-th node is value[i]; The parent of the i-th node i 阅读全文

posted @ 2019-12-03 21:41 seyjs 阅读(625) 评论(0) 推荐(0) 编辑

【leetcode】1274. Number of Ships in a Rectangle

摘要：题目如下： (This problem is an interactive problem.) On the sea represented by a cartesian plane, each ship is located at an integer point, and each intege 阅读全文

posted @ 2019-12-03 19:26 seyjs 阅读(378) 评论(0) 推荐(0) 编辑

【leetcode】1272. Remove Interval

摘要：题目如下： Given a sorted list of disjoint intervals, each interval intervals[i] = [a, b] represents the set of real numbers x such that a <= x < b. We rem 阅读全文

posted @ 2019-12-03 19:24 seyjs 阅读(495) 评论(0) 推荐(0) 编辑

【leetcode】1271. Hexspeak

摘要：题目如下： A decimal number can be converted to its Hexspeak representation by first converting it to an uppercase hexadecimal string, then replacing all o 阅读全文

posted @ 2019-12-03 19:05 seyjs 阅读(737) 评论(0) 推荐(0) 编辑

2019年11月28日

【leetcode】815. Bus Routes

摘要：题目如下： We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means 阅读全文

posted @ 2019-11-28 10:40 seyjs 阅读(171) 评论(0) 推荐(0) 编辑

【leetcode】745. Prefix and Suffix Search

摘要：题目如下： Given many words, words[i] has weight i. Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It wi 阅读全文

posted @ 2019-11-28 10:36 seyjs 阅读(327) 评论(0) 推荐(0) 编辑

公告