artemisrj的专栏

今天的计算机课上，老师给同学们出了一道题： 输入n个数，请将其中的偶数的二进制反转。 eg：输入1 6 5 其中6是偶数，二进制表示为110，反转后为011，代表3，所以最终输出1 3 5. 小贱君最近脑子不怎么好使，想了半天也没想出来如何做，最后他向你寻求帮助了，帮帮可怜的小贱君吧！输入描述:输入包含多组测试数据。对于每组测试数据：N — 输入的数字个数N个数：a0,a1,…,an-1保证

36. Valid SudokuDetermine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.主要是mask可以减少内存存储，

53. Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subar

Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For ex

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by

Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.class Solution {public:

Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2

cppreference输入输出 重定向 freopen(“input.txt”, “r”, stdin); 整行输入string a;#include<iostream> getline(cin, a); 因为那个啥超时的原因，需要C语言 char a[100];includeincludestring c; getline(cin,c); cin输入字母和数字int a[3],

class Solution {private: int backtrack(int r,int c,int m,int n){ if(r==m-1&&c==n-1){ return 1; } if(r>=m||c>=n){ return 0; } return b

第一种，javascript原生态函数,108ms/** * @param {string} haystack * @param {string} needle * @return {number} */var strStr = function(haystack, needle) { return haystack.indexOf(needle);};第二种，朴素字符串匹配

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with cons

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.You

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity./** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * thi

Given a linked list, swap every two adjacent nodes and return its head.For example, Given1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You may not

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Definition for singly-linked list. * function ListNo

Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but “

Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linke

Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string “23

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly