bernieloveslife

2018年10月6日

摘要： 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 @ 2018-10-06 13:22 bernieloveslife 阅读(98) 评论(0) 推荐(0)

836. Rectangle Overlap

摘要： A rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordinates of its bottom left corner, and (x2, y2) are the coordinates 阅读全文

posted @ 2018-10-06 13:22 bernieloveslife 阅读(117) 评论(0) 推荐(0)

142. Linked List Cycle II

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up: Can yo 阅读全文

posted @ 2018-10-06 13:22 bernieloveslife 阅读(100) 评论(0) 推荐(0)

2018年10月5日

914. X of a Kind in a Deck of Cards

摘要： In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X = 2 such that it is possible to split the enti 阅读全文

posted @ 2018-10-05 11:11 bernieloveslife 阅读(493) 评论(0) 推荐(0)

633. Sum of Square Numbers

摘要： Given a non negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c. Example 1: Input: 5 Output: True E 阅读全文

posted @ 2018-10-05 11:11 bernieloveslife 阅读(81) 评论(0) 推荐(0)

6. ZigZag Conversion

摘要： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font 阅读全文

posted @ 2018-10-05 11:11 bernieloveslife 阅读(84) 评论(0) 推荐(0)

5. Longest Palindromic Substring

摘要： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: 阅读全文

posted @ 2018-10-05 11:11 bernieloveslife 阅读(110) 评论(0) 推荐(0)

258. Add Digits

摘要： Given a non negative integer num, repeatedly add all its digits until the result has only one digit. Example: Input: 38 Output: 2 Explanation: The pro 阅读全文

posted @ 2018-10-05 11:11 bernieloveslife 阅读(88) 评论(0) 推荐(0)

2018年10月4日

342. Power of Four

摘要： Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example 1: Input: 16 Output: true Example 2: Input: 5 Output: 阅读全文

posted @ 2018-10-04 11:30 bernieloveslife 阅读(91) 评论(0) 推荐(0)

326. Power of Three

摘要： Given an integer, write a function to determine if it is a power of three. Example 1: Input: 27 Output: true Example 2: Input: 0 Output: false Example 阅读全文

posted @ 2018-10-04 11:30 bernieloveslife 阅读(123) 评论(0) 推荐(0)

公告