Veritas_des_Liberty

2018年10月22日

摘要： Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文

posted @ 2018-10-22 22:23 Veritas_des_Liberty 阅读(167) 评论(0) 推荐(0) 编辑

71. Simplify Path

摘要： Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"path = "/a/../../ 阅读全文

posted @ 2018-10-22 21:37 Veritas_des_Liberty 阅读(207) 评论(0) 推荐(0) 编辑

70. Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2018-10-22 18:47 Veritas_des_Liberty 阅读(175) 评论(0) 推荐(0) 编辑

69. Sqrt(x)

摘要： Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文

posted @ 2018-10-22 18:30 Veritas_des_Liberty 阅读(237) 评论(0) 推荐(0) 编辑

68. Text Justification

摘要： Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justif 阅读全文

posted @ 2018-10-22 18:10 Veritas_des_Liberty 阅读(154) 评论(0) 推荐(0) 编辑

2018年10月21日

65. Valid Number

摘要： Validate if a given string can be interpreted as a decimal number. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true" 阅读全文

posted @ 2018-10-21 19:27 Veritas_des_Liberty 阅读(192) 评论(0) 推荐(0) 编辑

64. Minimum Path Sum

摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文

posted @ 2018-10-21 13:58 Veritas_des_Liberty 阅读(156) 评论(0) 推荐(0) 编辑

63. Unique Paths II

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2018-10-21 13:40 Veritas_des_Liberty 阅读(173) 评论(0) 推荐(0) 编辑

2018年10月20日

62. Unique Paths

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2018-10-20 22:24 Veritas_des_Liberty 阅读(191) 评论(0) 推荐(0) 编辑

61. Rotate List

摘要： Given a linked list, rotate the list to the right by k places, where k is non-negative. Example 1: Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1-> 阅读全文

posted @ 2018-10-20 21:36 Veritas_des_Liberty 阅读(179) 评论(0) 推荐(0) 编辑

Veritas des Liberty

公告