王帅 - 博客园

2019年3月19日

摘要： I hate geometric problems…... java class Solution { public int minAreaRect(int[][] points) { Map xmap = new HashMap(); Map ymap = new HashMap(); Set s 阅读全文

posted @ 2019-03-19 21:24 王帅阅读(97) 评论(0) 推荐(0)

leetcode 941. Valid Mountain Array

摘要： dont know why, but I prefer to use for instead of while. 阅读全文

posted @ 2019-03-19 21:23 王帅阅读(109) 评论(0) 推荐(0)

942. DI String Match

摘要： Keep two int variable to record min and max value, when encounter I, use max++ value, on the contrary, use min . At last, add (min + 1) to all element 阅读全文

posted @ 2019-03-19 21:22 王帅阅读(58) 评论(0) 推荐(0)

leetcode 944. Delete Columns to Make Sorted

摘要： It is marked as easy, and it's really very easy. 阅读全文

posted @ 2019-03-19 21:20 王帅阅读(72) 评论(0) 推荐(0)

leetcode 946. Validate Stack Sequences

摘要： Just use a stack to simulate the push and pop process While stack is empty or peek does not equal to popped current value, push value into stack. Whil 阅读全文

posted @ 2019-03-19 21:19 王帅阅读(146) 评论(0) 推荐(0)

2019年3月18日

leetcode 947. Most Stones Removed with Same Row or Column

摘要： 947. Most Stones Removed with Same Row or Column Find connected components, with some specific connected component, the remove count is Num of element 阅读全文

posted @ 2019-03-18 23:17 王帅阅读(218) 评论(0) 推荐(0)

2019年3月17日

leetcode 953. Verifying an Alien Dictionary & 949. Largest Time for Given Digits & 948. Bag of Tokens

摘要： leetcode 953. Verifying an Alien Dictionary 949. Largest Time for Given Digits 948. Bag of Tokens Greedy solution: 1. Sort tokens first. 2. At each lo 阅读全文

posted @ 2019-03-17 17:38 王帅阅读(129) 评论(0) 推荐(0)

2019年3月16日

leetcode 957 Prison Cells After N Days & 955. Delete Columns to Make Sorted II

摘要： 957 Prison Cells After N Days The first intuition is that, after first day, the first and last cell will be vacant. So there'll be 2^6 = 64 total stat 阅读全文

posted @ 2019-03-16 21:19 王帅阅读(188) 评论(0) 推荐(0)

leetcode 909. Snakes and Ladders

摘要： For problems which need to find the least moves to some target, just breath first search. And keep three variables while searching: 1. visited node to 阅读全文

posted @ 2019-03-16 14:57 王帅阅读(170) 评论(0) 推荐(0)

2019年3月14日

leetcode 1007 Minimum Domino Rotations For Equal Row & leetcode 1008 Construct Binary Search Tree from Preorder Traversal

摘要： leetcode 1007 Minimum Domino Rotations For Equal Row Use three int array of size 6 The first one invalid array records valid(or invalid) numbers which 阅读全文

posted @ 2019-03-14 22:14 王帅阅读(108) 评论(0) 推荐(0)