- 博客(15)
- 资源 (9)
- 收藏
- 关注
RSS订阅原创 424. Longest Repeating Character Replacement
public class Solution { public int characterReplacement(String s, int k) { int start=0; int end=0; int maxlength=0; int len=s.length(); int[] count=new int[2
2017-02-13 14:12:11
290
原创 423. Reconstruct Original Digits from English
public class Solution { public String originalDigits(String s) { int[] count = new int[10]; for (int i = 0; i < s.length(); i++){ char c = s.charAt(i); if (c
2017-02-13 10:20:12
284
原创 421. Maximum XOR of Two Numbers in an Array
class Solution {public: int findMaximumXOR(vector<int>& nums) { int max=0; int mask=0; unordered_set<int> s; for(int i=31;i>=0;i--) { s.clear();
2017-02-12 12:08:35
266
原创 419. Battleships in a Board
public class Solution { public int countBattleships(char[][] board) { int m=board.length; if(m==0) return 0; int n=board[0].length; if(n==0)
2017-02-10 16:01:43
310
原创 417. Pacific Atlantic Water Flow dfs
public class Solution { public List<int[]> pacificAtlantic(int[][] matrix) { List<int[]> ret=new ArrayList<int[]>(); int m=matrix.length; if(m==0) return ret;
2017-02-09 19:05:23
273
原创 417. Pacific Atlantic Water Flow
public class Solution { public List<int[]> pacificAtlantic(int[][] matrix) { List<int[]> ret=new ArrayList<int[]>(); int m=matrix.length; if(m==0) return ret;
2017-02-09 16:00:09
331
原创 Principal Component Analysis
pca的目标是通过基变换 使得元素的方差从大到小排列 并且元素之间的协方差为0（线性无关）。而元素的协方差 矩阵的对角线上是元素的方差 ，对角线外的元素是协方差。 我们的目标就是 找到单位正交基，使得通过基变换后 ，元素的方差从大到小排列 而不同元素的协方差为0 。元素的协方差矩阵 和经过基变换后的协方差矩阵关系如下 原数据为X X的协方差矩阵为C Y=PX P为变换矩阵 Y为变换后的元
2017-02-08 20:41:42
379
原创 416. Partition Equal Subset Sum
public class Solution { public boolean canPartition(int[] nums) { int sum=0; for(int num:nums) { sum+=num; } if(sum%2==1) return false;
2017-02-08 15:56:43
320
原创 415. Add Strings
public class Solution { public String addStrings(String num1, String num2) { int carry=0; StringBuilder sb=new StringBuilder(); for(int i=num1.length()-1,j=num2.length()-1;i
2017-02-08 11:22:17
309
原创 414. Third Maximum Number
public class Solution { public int thirdMax(int[] nums) { Integer max1=null; Integer max2=null; Integer max3=null; for(Integer num:nums) { if(num
2017-02-07 14:35:44
325
原创 413. Arithmetic Slices
class Solution {public: int numberOfArithmeticSlices(vector<int>& A) { int n=A.size(); if(n<3) return 0; vector<int> dp(n,0);//dp[i]表示以i结尾的等差数列的个数 if(A[
2017-02-07 13:48:03
264
原创 412. Fizz Buzz
class Solution {public: vector<string> fizzBuzz(int n) { vector<string> ret; for(int i=1;i<=n;i++) { bool timeofthree=(i%3==0); bool timeoffive=(i%5
2017-02-07 10:57:08
237
原创 410. Split Array Largest Sum
class Solution {private: bool valid(int target,vector<int>& nums,int m) { int count=1;//count应该初始化1 int total=0; for(int num:nums) { total+=num;
2017-02-06 15:08:51
276
原创 409. Longest Palindrome
class Solution {private: bool static compare(int a,int b) { return a>b; }public: int longestPalindrome(string s) { map<char ,int > m; for(int i=0;i<s.size();i+
2017-02-06 10:48:17
220
原创 03. Frog Jump
public class Solution { public boolean canCross(int[] stones) { HashMap<Integer,HashSet<Integer>> map=new HashMap<>(); map.put(stones[0], new HashSet<Integer>()); map.get(st
2017-02-01 15:22:25
216
PID算法详解
2013-04-18
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人