北叶青藤

2019年8月8日

摘要： Let's play the minesweeper game (Wikipedia, online game)! You are given a 2D char matrix representing the game board. 'M' represents an unrevealed min 阅读全文

posted @ 2019-08-08 14:41 北叶青藤阅读(703) 评论(0) 推荐(0)

Infix to Prefix conversion using two stacks

摘要： Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1 o 阅读全文

posted @ 2019-08-08 00:35 北叶青藤阅读(461) 评论(0) 推荐(0)

Postfix to Infix

摘要： Infix expression: The expression of the form a op b. When an operator is in-between every pair of operands.Postfix expression: The expression of the f 阅读全文

posted @ 2019-08-08 00:24 北叶青藤阅读(290) 评论(0) 推荐(0)

Prefix to Infix Conversion

摘要： Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1 o 阅读全文

posted @ 2019-08-08 00:14 北叶青藤阅读(387) 评论(0) 推荐(0)

Postfix to Prefix Conversion & Prefix to Postfix Conversion

摘要： Postfix to Prefix Conversion Postfix: An expression is called the postfix expression if the operator appears in the expression after the operands. Sim 阅读全文

posted @ 2019-08-08 00:07 北叶青藤阅读(467) 评论(0) 推荐(0)

2019年8月5日

Compress and decompress string

摘要： You are given a string with lower case letters only. Compress it by putting the count of the letter after it. If the letter appears once, Example: com 阅读全文

posted @ 2019-08-05 04:52 北叶青藤阅读(283) 评论(0) 推荐(0)

2019年8月4日

Min swaps to sort array

摘要： Given an array with distinct numbers, return an integer indicating the minimum number of swap operations required to sort the array into ascending ord 阅读全文

posted @ 2019-08-04 08:48 北叶青藤阅读(213) 评论(0) 推荐(0)

Longest Increasing Subsequence

摘要： Find the longest increasing subsequence in an array. If there are multiple, return one of them. Example, for [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 阅读全文

posted @ 2019-08-04 05:34 北叶青藤阅读(127) 评论(0) 推荐(0)

2019年8月2日

Capacity To Ship Packages Within D Days

摘要： A conveyor belt has packages that must be shipped from one port to another within D days. The i-th package on the conveyor belt has a weight of weight 阅读全文

posted @ 2019-08-02 14:38 北叶青藤阅读(277) 评论(0) 推荐(0)

Bomb Enemy

摘要： Given a 2D grid, each cell is either a wall 'W', an enemy 'E' or empty '0' (the number zero), return the maximum enemies you can kill using one bomb.T 阅读全文

posted @ 2019-08-02 12:53 北叶青藤阅读(150) 评论(0) 推荐(0)

公告