honux77

public class Solution {
	public ArrayList <ArrayList<String>> partition(String s) {
		ArrayList <ArrayList<String>> ret = new ArrayList <ArrayList<String>>();

		if (s == null || s=="")
			return ret;

		ArrayList<String> palindrome = new ArrayList<String>();
		addPalindrome(s, 0, palindrome, ret);

honux77

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

honux77

/**
 * https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
public class Solution {

honux77

#include <stdio.h>

main() {
  printf("Hello, Blog\n");
}

honux77

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

using System.Net;
using System.Net.Sockets;

namespace nex1_server

honux77

/**
 * https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }

honux77

/**
 * https://oj.leetcode.com/problems/insertion-sort-list/
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }

honux77

#include "HelloWorldScene.h"

USING_NS_CC;

Scene* HelloWorld::createScene()
{
    // 'scene' is an autorelease object
    auto scene = Scene::create();
    
    // 'layer' is an autorelease object

honux77

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Threading;

namespace SandClock
{
    class Program

honux77

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {