ubuntu常见操作备注

1.打包文件夹 zip -r directionfilename.zip sourcefilename 2....

81. Search in Rotated Sorted Array II

problem: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Write a function to determine if ...

82. Remove Duplicates from Sorted List II

problem: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4->5, return 1->2->5...

80. Remove Duplicates from Sorted Array II

problem： Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5, wit...

79. Word Search

problem： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally...

78. Subsets

problem： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a solution is: [...

77. Combinations

problem： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,...

76. Minimum Window Substring

problem： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" Minimum ...

76条 共6页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：19206次
• 积分：892
• 等级：
• 排名：千里之外
• 原创：74篇
• 转载：2篇
• 译文：0篇
• 评论：6条
阅读排行
评论排行
最新评论