欧美日韩精品一区二区三区在线观看 ,91精品国产综合久久久久久久久久,中文字幕亚洲综合久久五月天色无吗''

eclipse 汉化�Ҏ��

feezh — Fri, 12 Oct 2012 06:48:00 GMT

�H�然��x��化eclips试试�Q�发现这��文章，
http://blog.csdn.net/gqqnb/article/details/6412364�Q�才知道eclipse有语�a�包，汗。。�?br />按照文章所��_��?br />http://www.eclipse.org/babel/downloads.php��面发现

点Eclipse help菜单---> software update

选Available Software选项卡，点击add site 新徏新的地址资源�Q�在地址里面�?相应版本地址安装卛_��?/p>

feezh 2012-10-12 14:48 发表评论

feezh — Thu, 19 Jul 2012 01:10:00 GMT

摘要: ��装�c�Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->package com.weidu.servlet;import java.io.IOException;import javax.servlet.ServletException;import j... 阅读全文

feezh 2012-07-19 09:10 发表评论

[java�l�典��法题]有n个�h围成一圈，��序排号。从�W�一个�h开始报敎ͼ��?�?报数�Q�，凡报�?的�h退出圈子，问最后留下的是原来第几号的那位？

feezh — Mon, 11 Jun 2012 16:08:00 GMT

题目�Q�有n个�h围成一圈，��序排号。从�W�一个�h开始报敎ͼ��?�?报数�Q�，凡报�?的�h退出圈子，问最后留下的是原来第几号的那位？

1package com.weidu.algorithms;
2
3import java.util.Arrays;
4import java.util.Scanner;
5
6/**
7 * @Title�Q?br /> 8 * @Description�Q?br /> 9 * @author Afei
10 * @date�Q?nbsp;日期�Q?012-6-10 旉��Q�下�?5:41:04
11 * @Copyright�Q�西北师范大学纬度工作室 Copyright (c) 2012
12 * @version:1.0
13 */
14public class Qu3 {
15
16    /**
17     * 功能说明:1�?nbsp;有n个�h围成一圈，��序排号。从�W�一个�h开始报敎ͼ��?�?报数�Q�，凡报�?的�h退出圈子，

18     * 问最后留下的是原来第几号的那位�?br />19     *
20     * @Afei 2012-6-10
21     * @param args
22     */
23
24    public static void main(String[] args) {
25        // TODO Auto-generated method stub
26        Scanner input = new Scanner(System.in);
27        System.out.print("误��入��M�h敎ͼ�");
28        int p = input.nextInt();
29        /**** 初始化�h�?nbsp;***/
30        boolean[] per = new boolean[p];// boolean数组表示站成一圈的人，false表示退�?/span>
31        for (int i = 0; i < per.length; i++) {
32            per[i] = true;
33        }
34
35        /**** 报号 ***/
36        int t = 0, len = per.length;
37        while (len > 1) {
38            for (int i = 0; i < per.length; i++) {
39
40                if (per[i]) {
41                    t++;
42                    if (t == 3) {
43                        t = 0;
44                        per[i] = false;
45                        len--;
46                    }
47                }
48            }
49        }
50        /***** �l�果 *****/
51        System.out.println("最后的情况�Q?/span>" + Arrays.toString(per));
52        for (int i = 0; i < per.length; i++) {
53            if (per[i]) {
54                System.out.println("原来喊的敎ͼ�" + (i + 1) % 3);
55            }
56        }
57    }
58}
59

feezh 2012-06-12 00:08 发表评论

feezh — Tue, 29 May 2012 13:41:00 GMT

- �q�几天做东西旉��C��个树形数据（或者说�U�联�Q�不会描�q�C��Q�就�q�么叫吧�Q�分�cȝ��问题�Q�开始有点纠�l�，后想��C��一�U�方法实玎ͼ�先分享出�?/span>�Q�高�?/span>勿喷�?/span>

正文开�?/strong>
现有三个�c�：分别是Chapter.java Section.java KnowledgePoint.java
Chapter.java
private Set sections = new HashSet(0);
public Set getSections() {
        return this.sections;
    }

public void setSections(Set sections) {
        this.sections = sections;
    }

Section.java
private Chapter chapter;
private Set knowledgePoints = new HashSet(0);
public Chapter getChapter() {
        return this.chapter;
    }

public void setChapter(Chapter chapter) {
        this.chapter = chapter;
    }
public Set getKnowledgePoints() {
        return this.knowledgePoints;
    }

public void setKnowledgePoints(Set knowledgePoints) {
        this.knowledgePoints = knowledgePoints;
    }

KnowledgePoint.java
private Section section;
public Section getSection() {
        return this.section;
    }

public void setSection(Section section) {
        this.section = section;
    }

可以看出章节有多个小节，��节有多个知识点。当取得知识点后怎么�Ҏ��不同的章节和��节分类呢？

List<KnowledgePoint> kps = this.allService.getKnowledgePointService()
                .findPoints(kpIds);//取得所选择的知识点
            /** *//********** �Ҏ��节分类知识�?**********/            Map<Integer, Section> map = new HashMap<Integer, Section>();
        for (int i = 0; i < kps.size(); i++) {
            Section section = kps.get(i).getSection();
            Integer key = section.getId();
            if (!map.containsKey(key)) {
                section.getKnowledgePoints().clear();
                map.put(key, section);
            }
            map.get(key).getKnowledgePoints().add(kps.get(i));
        }
        /** *//********** �Ҏ��章节分类��节 **********/
            Map<Integer, Chapter> cpMap = new HashMap<Integer, Chapter>();
        Iterator<Section> it = map.values().iterator();
        while (it.hasNext()) {
            Section section = it.next();
            Chapter chapter = section.getChapter();
            Integer key = chapter.getId();
            if (!cpMap.containsKey(key)) {
                chapter.getSections().clear();
                cpMap.put(key, chapter);
            }
            cpMap.get(key).getSections().add(section);
        }

feezh 2012-05-29 21:41 发表评论

欧美日韩精品一区二区三区在线观看 ,91精品国产综合久久久久久久久久,中文字幕亚洲综合久久五月天色无吗''

eclipse 汉化�Ҏ��

[java�l�典���法题]有n个�h围成一圈，��序排号。从�W�一个�h开始报敎ͼ��?�?报数�Q�，凡报�?的�h退出圈子，问最后留下的是原来第几号的那位？

[java�l�典��法题]有n个�h围成一圈，��序排号。从�W�一个�h开始报敎ͼ��?�?报数�Q�，凡报�?的�h退出圈子，问最后留下的是原来第几号的那位？